Colibri: Fast mining of large static and dynamic graphs

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

Volumn , Issue , 2008, Pages 686-694

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

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

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Graph mining; Low rank approximation; Scalability

Indexed keywords

ADJACENCY MATRICES; DATA SETS; EVOLVING GRAPHS; GRAPH MINING; LIMITED STORAGES; LOSS OF ACCURACIES; LOW-RANK APPROXIMATION; ORDERS OF MAGNITUDES; ORTHOGONAL BASIS; OVER-COMPLETE; RANK STRUCTURES; REAL NETWORKS; SPACE AND TIME; SPARSE MATRICES; STATIC AND DYNAMICS;

COMPETITION; INTERNET; MINING; PUBLIC WORKS; SCALABILITY;

INFORMATION MANAGEMENT;

EID: 65449145629     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401973     Document Type: Conference Paper

References (30)

1. D. Achlioptas and F. McSherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2), 2007.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, (401):130-131, 1999.
3. 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.
4. A. Broder, R. Kumar, F. Maghoull, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In WWW Conf, 2000.
5. Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In KDD, pages 153-162, 2007.
6. S. Dorogovtsev and J. Mendes. Evolution of networks. Advances in Physics, 51:1079-1187, 2002.
7. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices i: Approximating matrix multiplication. SIAM Journal of Computing, 2005.
8. R Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition. SIAM Journal of Computing, 2005.
9. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Relative-error cur matrix decompositions. CoRR, abs/0708.3696, 2007.
10. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. SIGCOMM, pages 251-262, Aug-Sept. 1999.
11. G. Flake, S. Lawrence, C. L. Giles, and F. Coetzee Self-organization and identification of web communities. IEEE Computer, 35(3), Mar. 2002.
12. D. Gibson, J. Kleinberg, and P. Raghavan. Inferring web communities from link topology. In Ninth ACM Conference on Hypertext and Hypermedia, pages 225-234, New York, 1998.
13. M. Girvan and M. E. J. Newman. Community structure is social and biological networks.
14. G. H. Golub and C. F. Van-Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 2nd edition, 1989.
15. S. Guha, D. Gunopulos, and N. Koudas. Correlating synchronous and asynchronous data streams. In KDD, pages 529-534, 2003.
16. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS, pages 189-197, 2000.
17. K. V. R. Kanth, D. Agrawal, and A. K. Singh. Dimensionality reduction for similarity searching in dynamic databases. In SIGMOD Conference, pages 166-176, 1998.
18. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. KDD, 2003.
19. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, pages 177-187, 2005.
20. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
21. H. Ning, W. Xu, Y. Chi, Y. Gong, and T. S. Huang. Incremental spectral clustering with application to monitoring of evolving blog communities. In SDM, 2007.
22. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
23. S. Papadimitriou, J. Sun, and C. Faloutsos. Streaming pattern discovery in multiple time-series. In VLDB, pages 697-708, 2005.
24. W. Piegorsch and G. E. Casella. Inverting a sum of matrices. In SIAM Review, volume 32, pages 470-470, 1990.
25. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In KDD, pages 687-696, 2007.
26. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
27. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD, pages 374-383, 2006.
28. J. Sun, Y. Xie, H. Zhang, and C. Faloutsos. Less is more: Compact matrix decomposition for large sparse graphs. In SDM, 2007.
29. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems: An International Journal (KAIS), 2008.
30. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720, 2005.