Sciweavers

4 search results - page 1 / 1
» GraphScope: parameter-free mining of large time-evolving gra...
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 5 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 6 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 7 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
ICDM
2010
IEEE
158views Data Mining» more  ICDM 2010»
13 years 2 months ago
Patterns on the Connected Components of Terabyte-Scale Graphs
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...