Clustering with multi-layer graphs: A spectral perspective

IEEE Transactions on Signal Processing

Volumn 60, Issue 11, 2012, Pages 5820-5831

  Dong, Xiaowen ^a   Frossard, Pascal ^a   Vandergheynst, Pierre ^a   Nefedov, Nikolai ^b  

^a EPFL   (Switzerland)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

Clustering; graph based regularization; matrix factorization; multi layer graphs; spectrum of the graph

Indexed keywords

BASELINE METHODS; CLUSTERING; DATA SETS; GRAPH LAPLACIAN; GRAPH-BASED; MATRIX FACTORIZATIONS; MULTI-MODAL; MULTIPLE LAYERS; NOVEL METHODS; OBSERVATIONAL DATA; REGULARIZATION FRAMEWORK; SOCIAL NETWORKS; SPECTRUM OF THE GRAPH;

DATA PROCESSING;

GRAPH THEORY;

EID: 84867565770     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2012.2212886     Document Type: Article

References (44)

1. E. Schaeffer, "Graph clustering," Comput. Sci. Rev., vol. 1, no. 1, pp. 27-64, 2007.
2. N. Eagle, A. Clauset, A. Pentland, and D. Lazer, "Multi-dimensional edge inference," Proc. Nat. Acad. Sci., vol. 107, no. 9 E31, 2010.
3. N. Eagle and A. Pentland, "Reality mining: Sensing complex social systems," Pers. Ubiqu. Comput., vol. 10, no. 4, pp. 255-268, 2006.
4. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 8, pp. 888-905, 2000.
5. A. Kumar, P. Rai, and H. Daumé, III, "Co-regularized spectral clustering with multiple kernels," in Proc. NIPS 2010 Workshop New Directions in Multiple Kernel Learn., Whistler, BC, Canada, Dec. 11, 2010.
6. N. Eagle,A. Pentland, and D. Lazer, "Inferring social network structure using mobile phone data," Proc. Nat. Acad. Sci., vol. 106, no. 36, pp. 15274-15278, 2009.
7. U. von Luxburg, "A tutorial on spectral clustering," Statist. Comput., vol. 17, no. 4, pp. 395-416, 2007.
8. J. B. MacQueen, "Some methods for classification and analysis of multivariate observations," in Proc. 5th Berkeley Symp. Math. Statist. Probabil., 1967, vol. 1, pp. 281-297.
9. L. Lovász, "Random walks on graphs: A survey," Combinatorics, Paul Erdös is Eighty, vol. 2, pp. 353-398, 1996, János Bolyai Math. Soc., Budapest.
10. G. W. Stewart and J. Sun, Matrix Perturbation Theory. NewYork: Academic, 1990.
11. R. Bhatia, Matrix Analysis. New York: Springer, 1996.
12. J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. New York: Springer, 2006.
13. W. Tang, Z. Lu, and I. Dhillon, "Clustering with multiple graphs," in Proc. IEEE Int. Conf. Data Mining, Miami, FL, Dec. 6-9, 2009, pp. 1016-1021.
14. F. Chung, Spectral Graph Theory. New York: Amer. Math. Soc., 1997.
15. R. P. Horaud, "A short tutorial on graph Laplacians, Laplacian embedding, and spectral clustering," [Online]. Available: http://csustan. csustan.edu/~tom/Lecture-Notes/Clustering/GraphLaplacian-tutorial. pdf
16. D. Knossow, A. Sharma, D. Mateus, and R. P. Horaud, "Inexact matching of large and sparse graphs using Laplacian eigenvectors," in Proc. 7th Int. Workshop on Graph-Based Represent. Pattern Recogn., Venice, Italy, May 26-28, 2009, pp. 144-153.
17. A. Sharma, R. P. Horaud, D. Knossow, and E. von Lavante, "Mesh segmentation using Laplacian eigenvectors and Gaussian mixtures," in Proc. 2009 AAAI Fall Symp. Manifold Learn. Appl., Arlington, VA, Nov. 2009.
18. D. Zhou and B. Schölkopf, "A regularization framework for learning from graph data," in Proc. ICML 2004 Workshop on Statist. Relat. Learn. Its Connections to Other Fields, Banff, AB, Canada, Jul. 8, 2004, pp. 132-137.
19. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf, "Learning with local and global consistency," Advances in Neural Information Processing Systems, vol. 16, pp. 321-328, 2004, MIT Press, Cambridge, MA.
20. X. Zhu, Z. Ghahramani, and J. Lafferty, "Semi-supervised learning using Gaussian fields and harmonic functions," in Proc. 20th Int. Conf. Mach. Learn. (ICML), Washington DC, Aug. 21-24, 2003, pp. 912-919.
21. O. Bousquet, O. Chapelle, and M. Hein, "Measure based regularization," Advances in Neural Information Processing Systems, vol. 16, pp. 1221-1228, 2004, MIT Press, Cambridge, MA.
22. D. Zhou, J. Weston, A. Gretton, O. Bousquet, and B. Schölkopf, "Ranking on data manifolds," Advances in Neural Information Processing Systems, vol. 16, pp. 169-176, 2004, MIT Press, Cambridge, MA.
23. V. R. de Sa, "Spectral Clustering with two views," in Proc. ICML 2005 Workshop on Learn. Multiple Views (ICML), Bonn, Germany, Aug. 11, 2005, pp. 20-27.
24. N. Kiukkonen, J. Blom, O. Dousse, D. Gatica-Perez, and J. Laurila, "Towards rich mobile phone datasets: Lausanne data collection campaign," in Proc. ACM Int. Conf. Pervasive Services, Berlin, Germany, Jul. 2010.
25. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks," Proc. Nat. Acad. Sci., vol. 99, no. 12, pp. 7821-7826, 2002. (Pubitemid 34650963)
26. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, no. 2, 026113, 2004.
27. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Phys. Rev. E, vol. 69, no. 6, 066133, 2004.
28. N. Nefedov, "Multi-membership communities detection in mobile networks," in Proc. Int. Conf. Web Intell., Mining, Semantics, Sogndal, Norway, May 25-27, 2011.
29. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J. Statist. Mechan.: Theory and Exper., vol. 1742-5468, no. P10008, p. (12 pp.), 2008.
30. C. D. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval. New York: Cambridge Univ. Press, 2008.
31. R. B. Lehoucq and D. C. Sorensen, "Deflation techniques for an implicitly re-started arnoldi iteration," SIAM J. Matrix Anal. Appl., vol. 17, no. 4, pp. 789-821, 1996.
32. D. Cook and L. Holder,Mining Graph Data. New York:Wiley, 2006.
33. A. Smola and R. Kondor, "Kernels and regularization on graphs," in Proc. 16th Annu. Conf. Computat. Learn. Theory, Washington, DC, Aug. 24-27, 2003, pp. 144-158. (Pubitemid 37053201)
34. Q. Xu, M. desJardins, and K. Wagstaff, "Constrained spectral clustering under a local proximity structure," in Proc. 18th Int. FLAIRS Conf., Clearwater Beach, FL, May 15, 2005.
35. Z. Lu and M. Á. Carreira-Perpiñán, "Constrained spectral clustering through affinity propagation," in Proc. 21st IEEE Comput. Soc. Conf. on Vision Patt. Recogn., Anchorage, AL, Jun. 24-26, 2008, pp. 1-8.
36. Z. Li, J. Liu, and X. Tang, "Constrained clustering via spectral regularization," in Proc. IEEE Conf. Comput. Vision Pattern Recogn., 2009.
37. Z. Li and J. Liu, "Constrained clustering by spectral kernel learning," in Proc. 12th IEEE Int. Conf. Comput. Vision (ICCV), Kyoto, Japan, Sep. 9-Oct. 2, 2009, pp. 421-427.
38. X.Wang and I. Davidson, "Flexible constrained spectral clustering," in Proc. 16th ACM SIGKDD Int. Conf. Knowledge Discovery Data Min., Washington, DC, Jul. 25-28, 2010, pp. 563-572.
39. A. Argyriou, M. Herbster, and M. Pontil, "Combining graph Laplacians for semi-supervised learning," Advances in Neural Information Processing Systems, vol. 18, pp. 67-74, 2005, MIT Press, Cambridge, MA.
40. D. Zhou and C. Burges, "Spectral clustering and transductive learning with multiple views," in Proc. 24th Int. Conf. Mach. Learn. (ICML), Corvallis, OR, Jun. 20-24, 2007, pp. 1159-1166.
41. P. Muthukrishnan, D. Radev, and Q. Mei, "Edge weight regularization over multiple graphs for similarity learning," in Proc. 10th IEEE Int. Conf. Data Min., Sydney, Australia, Dec. 14-17, 2010, pp. 374-383.
42. Y. Cheng and R. Zhao, "Multiview spectral clustering via ensemble," in Proc. 2009 IEEE Int. Conf. Granular Comput., Nanchang, China, Aug. 17-19, 2009, pp. 101-106.
43. Z. Lu, B. Savas, W. Tang, and I. S. Dhillon, "Supervised link prediction using multiple sources," in Proc. 10th IEEE Int. Conf. Data Min., Sydney, Australia, Dec. 14-17, 2010, pp. 923-928.
44. V. Vasuki, N. Natarajan, Z. Lu, and I. S. Dhillon, "Affiliation recommendation using auxiliary networks," in Proc. 4th ACM Conf. Recommender Syst. (RecSys), Barcelona, Spain, Sep. 26-30, 2010, pp. 103-110.