Community detection using a measure of global influence

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

Volumn 5498 LNAI, Issue , 2009, Pages 20-35

  Ghosh, Rumi ^a   Lerman, Kristina ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Community; Influence; Modularity; Social networks

Indexed keywords

COMMUNITY; COMMUNITY DETECTION; EDGE-BASED; INFLUENCE; MODULARITY; NETWORK CONNECTIVITY; NETWORK DATA; ONLINE SOCIAL NETWORKS; OPTIMIZATION METHOD; SOCIAL NETWORKS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; ELECTRIC NETWORK ANALYSIS; POPULATION DYNAMICS;

SOCIAL NETWORKING (ONLINE);

EID: 78650142311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14929-0_2     Document Type: Conference Paper

References (31)

1. Arenas, A., Fernandez, A., Fortunato, S., Gomez, S.: Motif-based communities in complex networks. Mathematical Systems Theory 41, 224001 (2008)
2. Atkin, R.: From cohomology in physics to q-connectivity in social science. International Journal of Man-Machines Studies 4, 341-362 (1972)
3. Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. on Knowl. and Data Eng. 20(2), 172-188 (2008)
4. Clauset, A.: Finding local community structure in networks. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics) 72(2) (2005)
5. de Sola Pool, I., Kochen, M.: Contacts and influence. Social Networks 1(1), 39-40 (1978-1979)
6. Ferrar, W.L.: Finite Matrices. Oxford University Press, Oxford (1951)
7. Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23, 298-305 (1973)
8. Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104, 36 (2007)
9. Ghosh, R., Lerman, K.: Community detection using a measure of global influence. In: Proc. of the 2nd KDD Workshop on Social Network Analysis, SNAKDD 2008 (2008)
10. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821 (2002)
11. Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters (2001)
12. Granovetter, M.: The strength of weak ties. The American Journal of Sociology (May 1973)
13. Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18, 39-40 (1953)
14. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD 2003: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137-146. ACM, New York (2003)
15. Koutsourelakis, P.S., Eliassi-Rad, T.: Finding mixed-memberships in social networks. In: AAAI Spring Symposium Social Information Processing (2008)
16. Legrand, J.: How far can q-analysis go into social systems understanding? In: Fifth European Systems Science Congress (2002)
17. Leicht, E.A., Newman, M.E.J.: Community structure in directed networks. Physical Review Letters 100, 118703 (2008)
18. Lerman, K., Plangprasopchok, A., Wong, C.: Personalizing results of image search on flickr. In: AAAI workshop on Intelligent Techniques for Web Personlization (2007)
19. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the World Wide Web Conference (2008)
20. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019-1031 (2007)
21. Newman, M.E.J.: Detecting community structure in networks. The European Physical Journal B 38, 321-330 (2004)
22. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review E 69, 066133 (2004)
23. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74, 036104 (2006)
24. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103, 8577 (2006)
25. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69, 026113 (2004)
26. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
27. Pothen, A., Simon, H., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430-452 (1990)
28. Tong, H., Faloutsos, C., Pan, J.: Fast random walk with restart and its applications. In: Sixth International Conference on Data Mining, ICDM 2006, pp. 613-622 (2006)
29. Tong, H., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Proximity tracking on timeevolving bipartite graphs. In: SDM, pp. 704-715. SIAM, Philadelphia (2008)
30. Zachary, W.W.: An information ow model for conict and ssion in small groups. Journal of Anthropological Research 33, 452-473 (1977)
31. Zhou, H.: Network landscape from a brownian particles perspective. Physical Review E 67 (2003)