General tensor spectral co-clustering for higher-order data

Advances in Neural Information Processing Systems

Volumn , Issue , 2016, Pages 2567-2575

  Wu, Tao ^a   Benson, Austin R ^b   Gleich, David F ^a  

^a PURDUE UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; TENSORS;

CO-CLUSTERING; NON NEGATIVES; RANDOM WALK MODELING; REAL-WORLD DATASETS; SPECTRAL CLUSTERING; STATE OF THE ART; SYMMETRIC TENSORS; SYNTHETIC DATASETS;

CLUSTER ANALYSIS;

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

References (27)

1. B. W. Bader, T. G. Kolda, et al Matlab tensor toolbox version 2.6. Available online, February 2015.
2. B.-K. Bao, W. Min, K. Lu, and C. Xu. Social event detection with robust high-order co-clustering. In ICMR, pages 135-142, 2013.
3. M. Benaïm. Vertex-reinforced random walks and a conjecture of pemantle. Ann. Prob., 25(1):361-392, 1997.
4. A. R. Benson, D. F. Gleich, and J. Leskovec. Tensor spectral clustering for partitioning higher-order network structures. In SDM, pages 118-126, 2015.
5. A. R. Benson, D. F. Gleich, and L.-H. Lim. The spacey random walk: a stochastic process for higher-order data. arXiv, cs.NA:1602.02102, 2016.
6. D. Boley. Principal direction divisive partitioning. Data Mining and Knowledge Discovery, 2(4):325-344, 1998.
7. F. Chung. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics, 9(1):1-19, 2005. 10.1007/s00026-005-0237-z.
8. F. Chung. Four proofs for the Cheeger inequality and graph partition algorithms. In ICCM, 2007.
9. F. R. L. Chung. Spectral Graph Theory. AMS, 1992.
10. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269-274, 2001.
11. B. Gao, T.-Y. Liu, X. Zheng, Q.-S. Cheng, and W.-Y. Ma. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In KDD, pages 41-50, 2005.
12. D. Ghoshdastidar and A. Dukkipati. Spectral clustering using multilinear svd: Analysis, approximations and applications. In AAAI, pages 2610-2616, 2015.
13. D. F. Gleich, L.-H. Lim, and Y. Yu. Multilinear PageRank. SIAM J. Matrix Ann. Appl., 36(4):1507-1541, 2015.
14. M. Hein, S. Setzer, L. Jost, and S. S. Rangapuram. The total variation on hypergraphs-learning on hypergraphs revisited. In Advances in Neural Information Processing Systems, pages 2427-2435, 2013.
15. H. Huang, C. Ding, D. Luo, and T. Li. Simultaneous tensor subspace selection and clustering: the equivalence of high order SVD and k-means clustering. In KDD, pages 327-335, 2008.
16. S. Jegelka, S. Sra, and A. Banerjee. Approximation algorithms for tensor clustering. In Algorithmic learning theory, pages 368-383. Springer, 2009.
17. M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter. Multilayer networks. Journal of Complex Networks, 2(3):203-271, 2014.
18. M. Meilǎ and J. Shi. A random walks view of spectral segmentation. In AISTATS, 2001.
19. M. Mihail. Conductance and convergence of markov chains - a combinatorial treatment of expanders. In FOCS, pages 526-531, 1989.
20. J. Ni, H. Tong, W. Fan, and X. Zhang. Flexible and robust multi-network clustering. In KDD, pages 835-844, 2015.
21. E. E. Papalexakis and N. D. Sidiropoulos. Co-clustering as multilinear decomposition with sparse latent factors. In ICASSP, pages 2064-2067. IEEE, 2011.
22. E. A. Pechenick, C. M. Danforth, and P. S. Dodds. Characterizing the Google Books corpus: strong limits to inferences of socio-cultural and linguistic evolution. PloS one, 10(10):e0137041, 2015.
23. S. Ragnarsson and C. F. Van Loan. Block tensors and symmetric embeddings. Linear Algebra Appl., 438(2):853-874, 2013.
24. S. E. Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, 2007.
25. W. J. Stewart. Introduction to the numerical solutions of Markov chains. Princeton Univ. Press, 1994.
26. D. Wagner and F. Wagner. Between min cut and graph bisection. In MFCS, pages 744-750, 1993.
27. D. Zhou and C. J. Burges. Spectral clustering and transductive learning with multiple views. In ICML, pages 1159-1166, 2007.