Using local spectral methods to robustify graph-based learning algorithms

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

Volumn 2015-August, Issue , 2015, Pages 359-368

  Gleich, David F ^a   Mahoney, Michael W ^b  

^a Purdue University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DIFFUSION; GRAPHIC METHODS; LEARNING ALGORITHMS;

DIFFUSION METHOD; GRAPH CONSTRUCTION; GRAPH-BASED LEARNING; MATRIX POLYNOMIALS; PRODUCT CATEGORIES; SEMI-SUPERVISED AND TRANSDUCTIVE LEARNING; SPARSE GRAPHS; SPECTRAL METHODS;

GRAPH THEORY;

EID: 84954170997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2783258.2783376     Document Type: Conference Paper

References (32)

1. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In FOCS, 2006.
2. R. Andersen and K. Lang. An algorithm for improving graph partitions. In SODA, 2008.
3. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.
4. M. Belkin and P. Niyogi. Semi-supervised learning on riemannian manifolds. Mach. Learn., 56(1-3):209-239, 2004.
5. P. Berkhin. Bookmark-coloring algorithm for personalized PageRank computing. Internet Math., 3(1):41-62, 2007.
6. F. R. L. Chung. Spectral graph theory, Volume 92. American Mathematical Society, 1997.
7. R. R. Coifman and S. Lafon. Diffusion maps. Applied and Computational Harmonic Analysis, 21(1):5-30, 2006.
8. C. A. R. de Sousa, S. O. Rezende, and G. E. Batista. Influence of graph construction on semi-supervised learning. In ECML/PKDD, pages 160-175. Springer, 2013.
9. A. Gittens and M. W. Mahoney. Revisiting the Nyström method for improved large-scale machine learning. In ICML, Volume 28, pages 567-575, 2013.
10. D. F. Gleich and M. M. Mahoney. Algorithmic antidifferentiation: A case study with min-cuts, spectral, and flow. In ICML, 2014.
11. T. J. Hansen and M. W. Mahoney. Semi-supervised eigenvectors for locally-biased learning. In NIPS, 2012.
12. G. Jeh and J. Widom. Scaling personalized web search. In WWW, pages 271-279. ACM, 2003.
13. L. G. S. Jeub, P. Balachandran, M. A. Porter, P. J. Mucha, and M. W. Mahoney. Think locally, act locally: Detection of small, medium-sized, and large communities in large networks. Physical Review E, 91:012821, 2015.
14. T. Joachims. Transductive learning via spectral graph partitioning. In ICML, pages 290-297, 2003.
15. K. Kloster and D. F. Gleich. Heat kernel based community detection. In KDD, 2014.
16. I. M. Kloumann and J. M. Kleinberg. Community membership identification from small seed sets. In KDD, pages 1366-1375, 2014.
17. J. Leskovec. Supporting website. snap.stanford.edu/data.
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, September 2009.
19. M. W. Mahoney, L. Orecchia, and N. K. Vishnoi. A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. JMLR, 13:2339-2365, 2012.
20. F. McSherry. A uniform approach to accelerated PageRank computation. In WWW, pages 575-582. ACM, 2005.
21. M. Newman. Network data. www-personal.umich.edu/~mejn/netdata.
22. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74(3):036104, September 2006.
23. L. Orecchia and M. W. Mahoney. Implementing regularization implicitly via approximate eigenvector computation. In ICML, pages 121-128, 2011.
24. S. Roweis and L. Saul. Nonlinear dimensionality reduction by local linear embedding. Science, 290:2323-2326, 2000.
25. H. Shin, N. J. Hill, A. M. Lisewski, and J.-S. Park. Graph sharpening. Expert. Syst. Appl., 37(12):7870-7879, 2010.
26. D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput., 42:1-26, 2013.
27. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
28. A. L. Traud, P. J. Mucha, and M. A. Porter. Social structure of Facebook networks. arXiv, cs.SI:1102.2166, 2011.
29. J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In ICDM, 2012.
30. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In NIPS, pages 1601-1608, 2004.
31. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In NIPS, 2003.
32. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML, pages 912-919, 2003.