Clustered low rank approximation of graphs in information science applications

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Volumn , Issue , 2011, Pages 164-175

  Savas, Berkant ^a   Dhillon, Inderjit S ^a,b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Clustering; Dimension reduction; Graph mining; Low rank matrix approximation; Stochastic algorithms

Indexed keywords

APPROXIMATION THEORY; CLUSTERING ALGORITHMS; DATA MINING; SINGULAR VALUE DECOMPOSITION; STOCHASTIC SYSTEMS;

CLUSTERING; DIMENSION REDUCTION; GRAPH MINING; LOW-RANK MATRIX APPROXIMATIONS; STOCHASTIC ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84864650291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.15     Document Type: Conference Paper

References (33)

1. A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In IEEE IPDPS, 2006.
2. T. Aittokallio and B. Schwikowski. Graph-basedmethods for analysing networks in cell biology. Briefings in Bioinformatics, 7:243-255, 2006.
3. F. R. Bach and M. I. Jordan. Learning spectral clustering. In NIPS, 2004.
4. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD, pages 44-54, 2006.
5. C. Boutsidis, M. W. Mahoney, and P. Drineas. An improved approximation algorithm for the column subset selection problem. In ACM-SIAM Symposium on Discrete Algorithms, pages 968-977, 2009.
6. C. Boutsidis, J. Sun, and N. Anerousis. Clustered subset selection and its applications on IT service metrics. In ACM CIKM, pages 599-608, 2008.
7. V. Castelli, A. Thomasian, and C.-S. Li. CSVD: Clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE TKDE, 15(3):671-685, 2003.
8. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE TPAMI, 29(11):1944-1957, 2007.
9. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1/2):143-175, 2001.
10. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SICOMP, 36(1):158-183, 2006.
11. C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1:211-218, 1936.
12. M. Filippone, F. Camastra, F. Masulli, and S. Rovetta. A survey of kernel and spectral methods for clustering. Pattern Recognition, 41(1):176-190, 2008.
13. E. Gallopoulos and D. Zeimpekis. CLSI: A flexible approximation scheme from clustered term-document matrices. In SDM, 2005.
14. G. H. Golub and C. F. Van Loan. Matrix Computations. Third edition, 1996.
15. L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning and clustering. Computer-Aided Design of Integrated Circuits and Systems, 11(9):1074-1085, Sep 1992.
16. N. Halko, P. G. Martinsson, and J. A. Tropp. Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions. Tech. rep. 2009-05, App. and Comp. Math, California Institute of Technology, 2009.
17. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18:39-43, 1953.
18. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
19. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, pages 695-704, 2008.
20. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007.
21. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
22. S. Parthasarathy, S. Tatikonda, and D. Ucar. A Survey of Graph Mining Techniques for Biological Datasets, chapter 18, pages 547-580. Springer, 2010.
23. V. Rokhlin, A. Szlam, and M. Tygert. A randomized algorithm for principal component analysis. SIMAX, 31(3):1100-1124, 2009.
24. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE TPAMI, 22:888-905, 2000.
25. H. H. Song, B. Savas, T. W. Cho, V. Dave, Z. Lu, Y. Dhillon, Y. Zhang, and L. Qiu. Clustered embedding of massive online social networks. In preparation, UT Austin, 2010.
26. H. H. Song, T. W. Cho, V. Dave, Y. Zhang, and L. Qiu. Scalable proximity estimation and link prediction in online social networks. In IMC SIGCOMM, pages 322-335, 2009.
27. G.W. Stewart. Matrix Algorithms, volume II: Eigensystems. SIAM, 2001.
28. B. Taskar, M.-F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIPS, 2004.
29. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In ACM SIGKDD, pages 747-756, 2007.
30. V. Vasuki, N. Natarajan, Z. Lu, B. Savas, and I. S. Dhillon. Scalable affiliation recommendation using auxiliary networks. To appear in ACM TIST, 2010.
31. D. Wagner and F. Wagner. Between min cut and graph bisection. In MFCS, pages 744-750, 1993.
32. K. Zhang and J. T. Kwok. Clustered Nyström method for large scale manifold learning and dimension reduction. IEEE TNN, 21:1576-1587, 2010.
33. Z. Zhang and H. Zha. Structure and perturbation analysis of truncated SVDs for column-partitioned matrices. SIMAX, 22(4):1245-1262, 2001.