On clustering graph streams

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 478-489

  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

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DIGITAL STORAGE;

CLUSTERING PROCESS; COMPLEX STRUCTURE; COMPUTATIONAL CHALLENGES; DISTANCE COMPUTATION; GRAPH CLUSTERING; MICRO-CLUSTERS; MULTIDIMENSIONAL DATA; UNDERLYING GRAPHS;

DATA MINING;

EID: 79957876446     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.42     Document Type: Conference Paper

References (22)

1. C. Aggarwal, N. Ta, J. Feng, J. Wang, and M. J. Zaki, XProj: A Framework for Projected Structural Clustering of XML Documents, KDD Conference Proceedings (2007), pp. 46-55.
2. C. Aggarwal, J. Han, J. Wang, and P. Yu, A Framework for Clustering Evolving Data Streams, VLDB Conference Proceedings (2003), pp. 81-92.
3. C. Aggarwal, Data Streams: Models and Algorithms, Springer (2007).
4. C. Aggarwal, and H. Wang, Managing and Mining Graph Data, Springer (2010).
5. N. Alon, Y. Matias, and M. Szegedy, The Space Complexity of Approximating the Frequency Moments, ACM Symposium on Theory of Computing (1996), pp. 20-29.
6. A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Syntactic clustering of the Web, WWW Conference, Computer Networks (1997), 29(8-13), pp. 1157-1166.
7. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani, Streaming-Data Algorithms For High-Quality Clustering, ICDE Conference Proceedings (2002), pp. 685.
8. D. Chakrabarti, R. Kumar, and A. Tomkins, Evolutionary clustering, KDD Conference Proceedings, (2006) pp. 554-560.
9. G. Cormode, and S. Muthukrishnan, An Improved Data-Stream Summary: The Count-min Sketch and its Applications, Journal of Algorithms (2005), 55(1), pp. 58-75.
10. T. Dalmagas, T. Cheng, K.-J. Winkel, and T. Sellis, Clustering XML Documents using Structural Summaries, in Lecture Notes in Computer Science (2005), Vol. 3268, pp. 547-556.
11. G. Flake, R. Tarjan, and M. Tsioutsiouliklis, Graph Clustering and Minimum Cut Trees, Internet Mathematics (2003), 1(4), pp. 385-408.
12. D. Gibson, R. Kumar, and A. Tomkins, Discovering Large Dense Subgraphs in Massive Graphs, VLDB Conference Proceedings (2005), pp. 721-732.
13. A. Jain, and R. Dubes, Algorithms for Clustering Data, Prentice Hall, New Jersey, (1998).
14. L. Kaufmann, and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, John Wiley & Sons, Inc., NY, (1990).
15. B. W. Kernighan, and S. Lin, An efficient heuristic for partitioning graphs, Bell Systems Technical Journal, (1970), 49, pp. 291-307.
16. M. S. Kim, and J. Han, A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks, PVLDB (2009), 2(1), pp. 622-633.
17. S. Raghavan, and H. Garcia-Molina, Representing web graphs. ICDE Conference Proceedings (2003), pp. 405-416.
18. M. Rattigan, M. Maier, and D. Jensen, Graph Clustering with Network Sructure Indices, ICML Conference Proceedings (2007), pp. 783-790.
19. A. A. Tsay, W. S. Lovejoy, and D. R. Karger, Random Sampling in Cut, Flow, and Network Design Problems, Mathematics of Operations Research (1999), 24(2), pp. 383-413.
20. M. J. Zaki, and C. C. Aggarwal, XRules: An Effective Structural Classifier for XML Data, ACM KDD Conference Proceedings (2003), pp. 316-325.
21. Z. Zeng, J. Wang, L. Zhou, and G. Karypis, Out-of-core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases, ACM Transactions on Database Systems (2007), Vol 31(2), pp. 13.
22. T. Zhang, R. Ramakrishnan, and M. Livny, BIRCH: An Efficient Data Clustering Method for Very Large Databases, ACM SIGMOD Conference Proceedings (1996), pp. 103-114.