Sciweavers

292 search results - page 45 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
SDM
2008
SIAM
121views Data Mining» more  SDM 2008»
13 years 8 months ago
Integration of Multiple Networks for Robust Label Propagation
Transductive inference on graphs such as label propagation algorithms is receiving a lot of attention. In this paper, we address a label propagation problem on multiple networks a...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
13 years 10 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
DMIN
2009
222views Data Mining» more  DMIN 2009»
13 years 4 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 1 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
13 years 10 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei