GraphScope: Parameter-free mining of large time-evolving graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 687-696

  Sun, Jimeng ^a   Faloutsos, Christos ^a   Papadimitriou, Spiros ^b   Yu, Philip S ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

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

Author keywords

Graphs; MDL; Mining; Streams

Indexed keywords

DATASETS; GRAPHSCOPE; SOCIAL INTERACTIONS;

DATA PROCESSING; GRAPH THEORY; INFORMATION RETRIEVAL SYSTEMS; ONLINE SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING;

DATA MINING;

EID: 36849035825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281266     Document Type: Conference Paper

References (20)

1. http://reality.media.mit.edu/download.php.
2. http://www.cs.cmu.edu/enron/.
3. C. C. Aggarwal and P. S. Yu. Online analysis of community evolution in data streams. In SDM, 2005.
4. R. Agrawal, R. Bayardo, C. Faloutsos, J. Kiernan, R. Rantzau, and R. Srikant. Auditing compliance with a hippocratic database. VLDB, 2004.
5. L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44-54, 2006.
6. D. Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In PKDD, pages 112-124, 2004.
7. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88. ACM Press, 2004.
8. T. M. Cover and J. A. Thomas. Elements of information theory. Wiley-Interscience, New York, NY, USA, 1991.
9. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
10. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, 1999.
11. D. S. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian. Compressing large boolean matrices using reordering techniques. In VLDB, pages 13-23, 2004.
12. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
13. E. Keogh, S. Lonardi, and C. A. Ratanamahatana. Towards parameter-free data mining. In KDD, pages 206-215, New York, NY, USA, 2004. ACM Press.
14. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In VLDB, 1999.
15. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In SIGKDD, 2005.
16. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
17. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
18. A. Pinar, T. Tao, and H. Ferhatosmanoglu. Compressing bitmap indices by data reorganization. In ICDE, pages 310-321, 2005.
19. J. Rissanen. A universal prior for integers and estimation by minimum description length. Annals of Statistics, 11(2):416-431, 1983.
20. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD, pages 374-383, 2006.