Patterns on the connected components of terabyte-scale graphs

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 875-880

  Kang, U ^a   McGlohon, Mary ^a   Akoglu, Leman ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Community connection model; Evolution of connected components; Graph mining

Indexed keywords

CONNECTED COMPONENT; CONNECTION MODEL; DYNAMIC GROWTH PROCESS; DYNAMIC PATTERNS; EVOLVING GRAPHS; GENERATIVE MODEL; GRAPH MINING; REAL-WORLD GRAPHS; WEB GRAPHS;

DATA MINING; FRACTAL DIMENSION;

GRAPHIC METHODS;

EID: 79951746679     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.121     Document Type: Conference Paper

References (24)

1. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations," in KDD, 2005.
2. U. Kang, M. McGlohon, L. Akoglu, and C. Faloutsos, "Patterns on the connected components of terabyte-scale graphs," ManuScript.
3. M. Mcglohon, L. Akoglu, and C. Faloutsos, "Weighted graphs and disconnected components: Patterns and a generator," KDD, 2008.
4. L. Akoglu, M. Mcglohon, and C. Faloutsos, "Rtm: Laws and a recursive generator for weighted time-evolving graphs," in ICDM, 2008.
5. L. Akoglu and C. Faloutsos, "Rtg: a recursive realistic graph generator using random typing," Data Min. Knowl. Discov., vol. 19, no. 2, pp. 194-209, 2009.
6. U. Kang, C. Tsourakakis, and C. Faloutsos, "Pegasus: A peta-scale graph mining system - implementation and observations," ICDM, 2009.
7. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec., "Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations," SDM, 2010.
8. R. Albert, H. Jeong, and A.-L. Barabasi, "Diameter of the world wide web," Nature, 1999.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," SIGCOMM, pp. 251-262, Aug-Sept. 1999. (Pubitemid 32081870)
10. P. Erdos and A. Renyi, "On the evolution of random graphs," Publ. Math. Inst. Hungary. Acad. Sci., vol. 5, pp. 17-61, 1960.
11. R. Kumar, J. Novak, and A. Tomkins, "Structure and evolution of online social networks," KDD, 2006.
12. M. A. Hasan and M. J. Zaki, "Output space sampling for graph patterns," PVLDB, 2009.
13. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang, "Fast graph pattern matching," ICDE, 2008.
14. F. Zhu, X. Yan, J. Han, and P. S. Yu, "gprune: A constraint pushing framework for graph pattern mining," PAKDD, 2007.
15. C. Chen, X. Yan, F. Zhu, and J. Han, "gapprox: Mining frequent approximate patterns from a massive network," ICDM, 2007.
16. X. Yan and J. Han, "gspan: Graph-based substructure pattern mining," ICDM, 2002.
17. N. S. Ketkar, L. B. Holder, and D. J. Cook, "Subdue: Compression-based frequent pattern discovery in graph data," OSDM, August 2005.
18. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi, "Scalable mining of large disk-based graph databases," KDD, 2004.
19. N. Wang, S. Parthasarathy, K.-L. Tan, and A. K. H. Tung, "Csv: Visualizing and mining cohesive subgraph," SIGMOD, 2008.
20. J. Chen, O. R. Zaiane, and R. Goebel, "Detecting communities in social networks using max-min modularity," SDM, 2009.
21. T. Falkowski, A. Barth, and M. Spiliopoulou, "Den-graph: A density-based community detection algorithm," Web Intelligence, 2007.
22. G. Karypis and V. Kumar, "Parallel multilevel k-way partitioning for irregular graphs," SIAM Review, vol. 41, no. 2, pp. 278-300, 1999.
23. N. Shrivastava, A. Majumder, and R. Rastogi, "Mining (social) network graphs to detect random link attacks," ICDE, 2008.
24. S. Papadimitriou and J. Sun, "Disco: Distributed co-clustering with map-reduce," ICDM, 2008.