Sciweavers

2227 search results - page 174 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
GFKL
2007
Springer
202views Data Mining» more  GFKL 2007»
15 years 5 months ago
Collective Classification for Labeling of Places and Objects in 2D and 3D Range Data
In this paper, we present an algorithm to identify types of places and objects from 2D and 3D laser range data obtained in indoor environments. Our approach is a combination of a c...
Rudolph Triebel, Óscar Martínez Mozo...
WWW
2010
ACM
15 years 8 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
PAKDD
2010
ACM
146views Data Mining» more  PAKDD 2010»
15 years 6 months ago
Mining Antagonistic Communities from Social Networks
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with ...
Kuan Zhang, David Lo, Ee-Peng Lim
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
15 years 4 months ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
13 years 3 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic