Tensor spectral clustering for partitioning higher-order network structures

SIAM International Conference on Data Mining 2015, SDM 2015

Volumn , Issue , 2015, Pages 118-126

  Benson, Austin R ^a   Gleiche, David F ^b   Leskovec, Jure ^a  

^a Stanford University   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; FLOW GRAPHS; GRAPH THEORY; MARKOV PROCESSES; NETWORK LAYERS; SPACE DIVISION MULTIPLE ACCESS; SPECTROSCOPY; TENSORS;

GRAPH PARTITIONING; HIGHER ORDER NETWORKS; HIGHER-ORDER STRUCTURE; NETWORK CLUSTERING; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING ALGORITHMS; SPECTRAL GRAPH THEORY; SYNTHETIC NETWORKS;

CLUSTERING ALGORITHMS;

EID: 84961905495     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. N. Alon and V. D. Milman. A, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1):73-88, 1985.
2. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Tel-garsky. Tensor decompositions for learning latent variable models. arXiv preprint arXiv: 1210.7559, 2012.
3. P. Boldi, R. Posenato, M. Santini, and S. Vigna. Traps and pitfalls of topic-biased PageRank. In Algorithms and Models for the Web-Graph, pages 107-116. Springer, 2008.
4. D. Boley, G. Ranjan, and Z.-L. Zhang. Commute times for a directed graph using an asymmetric Laplacian. Linear Algebra and its Applications, 435(2):224-242. 2011.
5. F. Chung. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics, 9(1): 1-19, 2005.
6. F. R. Chung. Spectral graph theory, volume 92. American Mathematical Soc, 1997.
7. J. Cohen. Graph twiddling in a mapreduce world. Computing in Science & Engineering, 11(4):29-4l, 2009.
8. I. Derényi, G. Palla, and T. Vicsek. Clique percolation in random networks. PRL, 94(16): 160202, 2005.
9. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, 2001.
10. N. Durak, A. Pinar, T. G. Kolda, and C. Seshadhri. Degree relations of triangles in real-world networks and graph models. In CIKM, 2012.
11. D. F. Gleich. Hierarchical directed spectral graph partitioning, 2006.
12. D. F. Gleich, L.-H. Lim, and A. Benson. The Spacey Random Surfer: A stochastic process for multilinear PageRank.
13. D. F. Gleich, L.-H. Lim, and Y. Yu. Multilinear PageRank. arXiv, cs.NA: 1409.1465, 2014.
14. M. S. Granovetter. The strength of weak ties. American Journal of Sociology, pages 1360-1380, 1973.
15. C. J. Hillar and L.-H. Lim. Most tensor problems are NP- hard. Journal of the ACM (JACM), 60(6):45, 2013.
16. F. Huang, U. Niranjan, M. Hakeem, and A. Anandkumar. Fast detection of overlapping communities via online tensor methods, 2013.
17. G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. VLSI design, 11(3):285-300, 2000.
18. Y. Kim, S.-W. Son, and H. leong. Finding communities in directed networks. Phys. Rev. E, 81:016103, Jan 2010.
19. C. Klymko, D. F. Gleich, and T. G. Kolda. Using triangles to improve community detection in directed networks. In Proceedings of the ASE BigData Conference, 2014.
20. T. G. Kolda and J. R. Mayo. Shifted power method for computing tensor eigenpairs. SIAM Journal on Matrix Analysis and Applications, 32(4): 1095-1124, 2011.
21. G. Kossinets and D. J. Watts. Empirical analysis of an evolving social network. Science, 311(5757):88-90, 2006.
22. E. A. Leicht and M. E. Newman. Community structure in directed networks. PRL, 100(11): 118703, 2008.
23. J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection, http ://snap.Stanford.edu/data, June 2014.
24. Y. Li, Z.-L. Zhang, and J. Bao. Mutual or unrequited love: Identifying stable clusters in social networks with uni-and bi-directional links. In Algorithms and Models for the Web Graph, pages 113-125. Springer, 2012.
25. F. D. Malliaros and M. Vazirgiannis. Clustering and community detection in directed networks: A survey. Physics Reports, 533(4):95-142, 2013.
26. A. Prat-Pérez, D. Dominguez-Sal, J. M. Brunat, and J.-L. Larriba-Pey. Shaping communities out of triangles. In CIKM, 2012.
27. L. Qi. Eigenvalues of a real supersymmetric tensor. Journal of Symbolic Computation, 40(6): 1302-1324, 2005.
28. K. Rohe and B. Yu. Co-clustering for directed graphs; the stochastic co-blockmodel and a spectral algorithm. arXiv preprint arXiv: 1204.2296, 2012.
29. M. Rosvall, A. V. Esquivel, A. Lancichinetti, J. D. West, and R. Lambiotte. Memory in network flows and its effects on spreading dynamics and community detection. Nature communications, 5, 2014.
30. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Experimental and Efficient Algorithms. 2005.