Less is more: Sparse graph mining with Compact Matrix Decomposition

Statistical Analysis and Data Mining

Volumn 1, Issue 1, 2008, Pages 6-22

  Sun, Jimeng ^a   Xie, Yinglian ^a   Zhang, Hui ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Data mining; Graph mining; Matrix decomposition

Indexed keywords

APPROXIMATION THEORY; CLUSTERING ALGORITHMS; GRAPH THEORY; SINGULAR VALUE DECOMPOSITION;

CITATION NETWORKS; FINANCIAL TRANSACTIONS; GRAPH MINING; HIDDEN VARIABLE; LESS IS MORES; LOW-RANK DECOMPOSITION; MATRIX DECOMPOSITION; NETWORK TRAFFIC MONITORING; SOCIAL NETWORK ANALYSIS; SPARSE GRAPHS;

DATA MINING;

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

References (30)

1. G. H. Golub and C. F. Van Loan, Matrix computations (3rd ed.), Baltimore, MD, USA, Johns Hopkins University Press, 1996.
2. I. T. Jolliffe, Principal Component Analysis (2nd ed.), New York, Berlin, Heidelberg, Springer Series in Statistics, 2002.
3. P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, J. ACM 53(3) (2006), 307-323.
4. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, Extracting Large-Scale Knowledge Bases from the Web. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., 1999, 639-650.
5. M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the internet topology. In SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, New York, NY, USA, ACM, 1999, 251-262.
6. P. Domingos and M. Richardson, Mining the network value of customers. In KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, ACM, 2001, 57-66.
7. P. Drineas, R. Kannan and M. W. Mahoney, Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition, SIAM J. Comput. 36(1) (2006), 184-206.
8. J. Leskovec, J. Kleinberg and C. Faloutsos, Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, New York, NY, USA, ACM, 2005, 177-187.
9. X. Yan, P. S. Yu and J. Han, Substructure similarity search in graph databases. In SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, New York, NY, USA, ACM, (2005), 766-777.
10. G. Cormode and S. Muthukrishnan, Space efficient mining of multigraph streams. In PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, New York, NY, USA, ACM, 2005, 271-282.
11. C. H. Papadimitriou, H. Tamaki, P. Raghavan and S. Vempala. Latent semantic indexing: A probabilistic analysis, 1998, 159-168.
12. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas and R. A. Harshman, Indexing by latent semantic analysis, J Am Soc Inf Sci 41(6) (1990), 391-407.
13. F. Korn, H. V. Jagadish and C. Faloutsos, Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, ACM Press, 1997, 289-300.
14. S. Guha, D. Gunopulos and N. Koudas, Correlating synchronous and asynchronous data streams. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, ACM, 2003, 529-534.
15. S. Papadimitriou, J. Sun and C. Faloutsos, Streaming pattern discovery in multiple time-series. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, Trondheim, Norway, VLDB Endowment, 2005, 697-708.
16. Z. Zhang, H. Zha and H. Simon, Low-rank approximations with sparse factors i: Basic algorithms and error analysis, J Matrix Anal Appl 23 (2002), 706-727.
17. D. Achlioptas and F. McSherry, Fast computation of low rank matrix approximations. In STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, New York, NY, USA, ACM, 2001, 611-618.
18. P. Drineas, R. Kannan and M. W. Mahoney, Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication, SIAM J. Comput. 36(1) (2006), 132-157.
19. P. Drineas, R. Kannan and M. W. Mahoney, Fast Monte Carlo Algorithms for Matrices II: Computing a Low Rank Approximation to a Matrix, SIAM J. Comput. 36(1) (2006), 158-183.
20. P. Drineas, I. Kerenidis and P. Raghavan, Competitive recommendation systems. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, New York, NY, USA, ACM, 2002, 82-90.
21. M. W. Berry, S. A. Pulatova and G. W. Stewart, Computing sparse reduced-rank approximations to sparse matrices, ACM Trans Math Softw 31 (2005), 252-269.
22. S. A. Goreinov, E. E. Tyrtyshnikov and N. L. Zamarashkin, A theory of pseudoskeleton approximations, J Linear Algebra Appl (1997), 261 1-21.
23. B. Babcock, S. Babu, M. Datar, R. Motwani and J. Widom, Models and issues in data stream systems. In PODS '02: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, New York, NY, USA, ACM, 2002, 1-16.
24. S. Muthukrishnan, Data streams: algorithms and applications. In SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, 2003, 413.
25. J. S. Vitter, Random sampling with a reservoir, ACM Trans Math Softw 11(1) (1985), 37-57.
26. P. B. Gibbons and Y. Matias, New sampling-based summary statistics for improving approximate query answers. In SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, New York, NY, USA, ACM, 1998, 331-342.
27. G. Cormode, M. Datar, P. Indyk and S. Muthukrishnan, Comparing Data Streams Using Hamming Norms (How to Zero In), IEEE Transactions on Knowledge and Data Engineering 15(3) (2003), 529-540.
28. V. Ganti, J. Gehrke and R. Ramakrishnan, Mining data streams under block evolution, SIGKDD Explor Newsl 3(2) (2002), 1-10.
29. http://www.informatik.uni-trier.de/ley/db/.
30. www.cs.cmu.edu/enron.