A framework for clustering massive graph streams

Statistical Analysis and Data Mining

Volumn 3, Issue 6, 2010, Pages 399-416

  Aggarwal, Charu C ^a   Zhao, Yuchen ^b   Yu, Philip S ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Illinois at Chicago   (United States)

Author keywords

Clustering; Data mining; Graphs

Indexed keywords

CLUSTERING ALGORITHMS; DIGITAL STORAGE; GRAPHIC METHODS;

CLUSTERINGS; COMPLEXES STRUCTURE; GRAPH; GRAPH CLUSTERING; GRAPH DATA; MASSIVE GRAPH; MICRO-CLUSTERS; MULTIDIMENSIONAL DATA; STATIC DATUM; UNDERLYING GRAPHS;

DATA MINING;

EID: 78649949475     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10090     Document Type: Article

References (26)

1. C. Aggarwal, N. Ta, J. Feng, J. Wang, and M. J. Zaki, XProj: a framework for projected structural clustering of XML documents, In KDD Conference, San Jose, California, USA, 2007.
2. D. Cook and L. Holder, Mining Graph Data, John Wiley & Sons Inc, 2007.
3. G. Flake, R. Tarjan, and M. Tsioutsiouliklis, Graph clustering and minimum cut trees, Internet Math 1(4) (2003), 385-408.
4. T. Dalmagas, T. Cheng, K.-J. Winkel, and T. Sellis, Clustering XML documents using structural summaries, Lect Notes Comput Sci 3268 (2005), 547-556.
5. X. Yan and J. Han, CloseGraph: mining closed frequent graph patterns, I ACM KDD Conference, Washington, DC, USA, 2003.
6. X. Yan, H. Cheng, J. Han, and P. S. Yu, Mining significant graph patterns by scalable leap search, In SIGMOD Conference, Vancouver, BC, Canada, 2008.
7. M. J. Zaki and C. C. Aggarwal, XRules: An Effective Structural Classifier for XML Data, In KDD Conference, Washington, DC, USA, 2003.
8. C. Aggarwal and H. Wang, Managing and Mining Graph Data, Springer, 2010.
9. S. Guha, R. Rastogi, and K. Shim, CURE: an efficient clustering algorithm for large databases, In ACM SIGMOD Conference, Seattle, Washington, USA, 1998.
10. A. Jain and R. Dubes, Algorithms for Clustering Data, New Jersey, Prentice Hall, 1998.
11. L. Kaufmann and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, New York, John Wiley & Sons, Inc., 1990.
12. T. Zhang, R. Ramakrishnan, and M. Livny, BIRCH: An Efficient Data Clustering Method for Very Large Databases, In ACM SIGMOD Conference, Montreal, Quebec, Canada, 1996.
13. M. Rattigan, M. Maier, and D. Jensen, Graph Clustering with Network Sructure Indices, In ICML Conference, Corvalis, Oregon, USA, 2007.
14. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst Tech J 49 (1970), 291-307.
15. A. A. Tsay, W. S. Lovejoy, and D. R. Karger, Random sampling in cut, flow, and network design problems, Math Oper Res 24(2) (1999), 383-413.
16. D. Gibson, R. Kumar, and A. Tomkins, Discovering Large Dense Subgraphs in Massive Graphs, In VLDB Conference, Trondheim, Norway, 2005.
17. Z. Zeng, J. Wang, L. Zhou, and G. Karypis, Out-of-core coherent closed quasi-clique mining from large dense graph databases, ACM Trans Database Syst 31(2) (2007), 1-40.
18. A. Abou-Rjeili and G. Karypis, Multilevel algorithms for partitioning power-law graphs, In IEEE International Parallel and Distributed Processing Symposium (IPDPS), Rhodes Island, Greece, 2006.
19. G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, In SIAM J. Sci. Comput. 20(1) (1998), 359-392.
20. S. Raghavan and H. Garcia-Molina, Representing web graphs, In ICDE Conference, Bangalore, India, 2003, 405-416.
21. C. Aggarwal, J. Han, J. Wang, and P. Yu., A framework for clustering evolving data streams, In VLDB Conference, Berlin, Germany, 2003.
22. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani, Streaming-Data Algorithms For High-Quality Clustering, In ICDE Conference, San Jose, California, USA, 2002.
23. A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Syntactic clustering of the web, WWW Conference, Comput Netw 29(8-13) (1997), 1157-1166.
24. N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, In ACM Symposium on Theory of Computing, Philadelphia, Pennsylvania, USA, 1996.
25. G. Cormode and S. Muthukrishnan, An improved data-stream summary: the count-min sketch and its applications, J Algorithms 55(1) (2005), 58-75.
26. C. Aggarwal, Data Streams: Models and Algorithms, Springer, 2007.