Sciweavers

14 search results - page 3 / 3
» Discovering parametric clusters in social small-world graphs
Sort
View
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
13 years 10 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
13 years 10 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
ICS
2010
Tsinghua U.
14 years 2 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
DMS
2010
189views Multimedia» more  DMS 2010»
13 years 3 months ago
Visualizing the Commonalities Between Hierarchically Structured Data Queries
Abstract--In this paper we present an information visualization approach for visualizing the intersection between multiple feature hierarchies. In cases where a dataset has multipl...
Chad Jones, Ryan Armstrong, Kwan-Liu Ma