Discovering Burst Areas in Fast Evolving Graphs
暂无分享,去创建一个
[1] Ravi Kumar,et al. On the Bursty Evolution of Blogspace , 2003, WWW '03.
[2] Philip S. Yu,et al. GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.
[3] Deepayan Chakrabarti,et al. AutoPart: Parameter-Free Graph Partitioning and Outlier Detection , 2004, PKDD.
[4] Frank Wm. Tompa,et al. Seeking Stable Clusters in the Blogosphere , 2007, VLDB.
[5] Marco Pellegrini,et al. Extraction and classification of dense communities in the web , 2007, WWW '07.
[6] Dino Pedreschi,et al. Knowledge Discovery in Databases: PKDD 2004 , 2004, Lecture Notes in Computer Science.
[7] Dennis Shasha,et al. Efficient elastic burst detection in data streams , 2003, KDD '03.
[8] Jeffrey Xu Yu,et al. Spotting Significant Changing Subgraphs in Evolving Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[9] Nick Koudas,et al. BlogScope: spatio-temporal analysis of the blogosphere , 2007, WWW '07.
[10] Ravi Kumar,et al. Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.
[11] Jimeng Sun,et al. MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.