A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 2339-2365

  Mahoney, Michael W ^a   Orecchia, Lorenzo ^b   Vishnoi, Nisheeth K ^c  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Laplacianmatrix; Local spectral algorithms; Personalized pagerank; Semi supervised learning; Spectral graph partitioning

Indexed keywords

LAPLACIANMATRIX; PAGERANK; SEMI-SUPERVISED LEARNING; SPECTRAL ALGORITHM; SPECTRAL GRAPH PARTITIONING;

CONSTRAINED OPTIMIZATION; GRAPHIC METHODS; INFORMATION SERVICES; MATRIX ALGEBRA; SUPERVISED LEARNING;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84869155042     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. R. Andersen and K. Lang. Communities from seed sets. In WWW '06: Proceedings of the 15th International Conference on World Wide Web, pages 223-232, 2006. (Pubitemid 46946613)
2. R. Andersen and K. Lang. An algorithm for improving graph partitions. In SODA '08: Proceedings of the 19th ACM-SIAM Symposium on Discrete algorithms, pages 651-660, 2008.
3. R. Andersen, F.R.K. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 475-486, 2006.
4. V. Batagelj and A. Mrvar. Pajek analysis and visualization of large networks. In Proceedings of Graph Drawing, pages 477-478, 2001.
5. P. Berkhin. A survey on PageRank computing. Internet Mathematics, 2(1):73-120, 2005.
6. L. Bourdev, S. Maji, T. Brox, and J. Malik. Detecting people using mutually consistent poselet activations. In Proceedings of the 11th European Conference on Computer Vision, 2010.
7. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, UK, 2004.
8. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the 7th International Conference on World Wide Web, pages 107-117, 1998.
9. F.R.K. Chung. Spectral Graph Theory, volume 92 of CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
10. F.R.K Chung. Four proofs of Cheeger inequality and graph partition algorithms. In Proceedings of ICCM, 2007.
11. A. P. Eriksson, C. Olsson, and F. Kahl. Normalized cuts revisited: A reformulation for segmentation with linear grouping constraints. In Proceedings of the 11th International Conference on Computer Vision, pages 1-8, 2007.
12. G. Gallo, M.D. Grigoriadis, and R.E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing, 18(1):30-55, 1989.
13. G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1996.
14. T.H. Haveliwala. Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering, 15(4):784-796, 2003.
15. G. Jeh and J. Widom. Scaling personalized web search. In WWW '03: Proceedings of the 12th International Conference on World Wide Web, pages 271-279, 2003.
16. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, 1989.
17. R. Khandekar, S. Rao, and U. Vazirani. Graph partitioning using single commodity flows. In STOC '06: Proceedings of the 38th annual ACM Symposium on Theory of Computing, pages 385-390, 2006. (Pubitemid 44306573)
18. I. Koutis, G. L. Miller, and R. Peng. Approaching optimality for solving SDD linear systems. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pages 235-244, 2010.
19. K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. In IPCO '04: Proceedings of the 10th International IPCO Conference on Integer Programming and Combinatorial Optimization, pages 325-337, 2004.
20. A. N. Langville and C. D. Meyer. Deeper inside PageRank. Internet Mathematics, 1(3):335-380, 2004.
21. J. Leskovec, K.J. Lang, A. Dasgupta, andM.W.Mahoney. Statistical properties of community structure in large social and information networks. InWWW'08: Proceedings of the 17th International Conference on World Wide Web, pages 695-704, 2008.
22. 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. Also available at: arXiv:0810.1355.
23. J. Leskovec, K.J. Lang, and M.W. Mahoney. Empirical comparison of algorithms for network community detection. In WWW '10: Proceedings of the 19th International Conference on World Wide Web, pages 631-640, 2010.
24. M. W. Mahoney. Approximate computation and implicit regularization for very large-scale data analysis. In Proceedings of the 31st ACM Symposium on Principles of Database Systems, pages 143-154, 2012.
25. M. W. Mahoney and L. Orecchia. Implementing regularization implicitly via approximate eigenvector computation. In Proceedings of the 28th International Conference on Machine Learning, pages 121-128, 2011.
26. M. Maire, P. Arbelaez, C. Fowlkes, and J. Malik. Using contours to detect and localize junctions in natural images. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 1-8, 2008.
27. S. Maji, N. K. Vishnoi, and J. Malik. Biased normalized cuts. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2057-2064, 2011.
28. M. Mihail. Conductance and convergence of Markov chains a combinatorial treatment of expanders. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 526-531, 1989. (Pubitemid 20725998)
29. M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 103(23):8577-8582, 2006a. (Pubitemid 43878062)
30. M.E.J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74:036104, 2006b.
31. L. Orecchia, L. Schulman, U.V. Vazirani, and N.K. Vishnoi. On partitioning graphs via single commodity flows. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 461-470, 2008.
32. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transcations of Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
33. D.A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04: Proceedings of the 36th annual ACM Symposium on Theory of Computing, pages 81-90, 2004.
34. H. A. van der Vorst. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. and Stat. Comput., 13(2):631-644, 1992.
35. S. X. Yu and J. Shi. Grouping with bias. In Annual Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference, pages 1327-1334, 2002.