ℓ 1-graph based community detection in online social networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7235 LNCS, Issue , 2012, Pages 644-651

  Huang, Liang ^a   Li, Ruixuan ^a   Li, Yuhua ^a   Gu, Xiwu ^a   Wen, Kunmei ^a   Xu, Zhiyong ^b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SUFFOLK UNIVERSITY   (United States)

Author keywords

1 graph; Graph Laplacian; Laplacian regularizer; Spectral clustering algorithm

Indexed keywords

COMMUNITY DETECTION; COMMUNITY STRUCTURES; COMPUTATIONAL COSTS; EFFICIENT ALGORITHM; GRAPH LAPLACIAN; GRAPH-BASED; ONLINE SOCIAL NETWORKS; RANDOM WALK; REGULARIZER; SMALL SAMPLES; SOCIAL NETWORKS;

CLUSTERING ALGORITHMS; LAPLACE TRANSFORMS; ONLINE SYSTEMS; POPULATION DYNAMICS; WEBSITES;

DIRECTED GRAPHS;

EID: 84859712492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29253-8_60     Document Type: Conference Paper

References (15)

1. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E. 69(2), 26113 (2004)
2. Fortunato, S., Latora, V., Marchiori, M.: Method to find community structures based on information centrality. Phys. Rev. E. 70(5), 56104 (2004)
3. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E. 69(2), 66133 (2004)
4. Barthélemy, M., Fortunato, S.: Resolution limit in community detection. Proc. Natl. Acad. Sci. 104, 36-41 (2007)
5. Li, Z.P., Chen, L.N., Zhang, S.H., Zhang, X.S., Wang, R.S.: Quantitative function for community detection. Phys. Rev. E. 77, 36109 (2008)
6. Luxburg, U.V.: A Tutorial on Spectral Clustering. Tech. Rep. 149, Max Planck Institute for Biological Cybernetics. (2006)
7. Cheng, B., Huang, T.S., Yang, J.C., Yan, S.C.: Learning With 1-graph for Image Analysis. IEEE Trans. on Image Processing 19, 858-866 (2010)
8. Belkin, M., Niyogi, P., Sindhwani, V.: Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples. J. Machine Learning Research 7, 2399-2434 (2006)
9. Chung, F.R.K.: Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics 9, 1-19 (2005)
10. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373-1396 (2002)
11. Smola, A.J., Kondor, R.: Kernels and regularization on grphs. In: Proc. of the 16th Annual Conference on Learning Theory (2003)
12. Cao, Y., Chen, D.R.: Consistency of regularized spectral clustering. Applied and Computational Harmonic Analysis 30, 319-336 (2011)
13. Stanford University Stanford Network Analysis Project, http://snap.stanford.edu/ncp/
14. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452-473 (1977)
15. Boisseau, O.J., Dawson, S.M., Haase, P., Lusseau, D., Schneider, K., Slooten, E.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54, 396-405 (2003)