Ranking individuals and groups by influence propagation

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

Volumn 6635 LNAI, Issue PART 2, 2011, Pages 407-419

  Li, Pei ^a   Yu, Jeffrey Xu ^b   Liu, Hongyan ^c   He, Jun ^a   Du, Xiaoyong ^a  

^a RENMIN UNIVERSITY OF CHINA   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; WEBSITES;

BETWEENNESS; CENTRALITY MEASURES; DECAY FUNCTION; EIGENVECTOR CENTRALITIES; IN-NETWORK ANALYSIS; LINK-BASED RANKING; PROPAGATION MODELING; REAL DATA SETS;

DATA MINING;

EID: 79957940549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20847-8_34     Document Type: Conference Paper

References (19)

1. Zhang, H., Smith, M., Giles, C.L., Yen, J., Foley, H.C.: Snakdd 2008 social network mining and analysis report. SIGKDD Explorations 10(2), 74-77 (2008)
2. Freeman, L.C.: Centrality in social networks: conceptual clarification. Social Networks 1, 215-239 (1978)
3. Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2(1), 113-120 (1972)
4. Newman, M.: The mathematics of networks. In: Blume, L., Durlauf, S. (eds.) The New Palgrave Encyclopedia of Economics, 2nd edn. Palgrave MacMillan, Basingstoke (2008), http://www-ersonal.umich.edu/~mejn/papers/palgrave.pdf
5. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (1999)
6. Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD, pp. 137-146 (2003)
7. Everett, M.G., Borgatti, S.P.: Extending centrality. In: Wasserman, S., Faust, K. (eds.) Social network analysis: methods and applications, pp. 58-63. Cambridge University Press, Cambridge (1994)
8. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
9. Valente, T.: Network Models of the Diffusion of Innovations. Hampton Press, New Jersey (1995)
10. Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.O.: Combating web spam with trustrank. In: VLDB, pp. 576-587 (2004)
11. Sarkar, P., Moore, A.W.: Fast dynamic reranking in large graphs. In: WWW, pp. 31-40 (2009)
12. Centrality in Wikipedia, http://en.wikipedia.org/wiki/Centrality
13. Dangalchev, C.: Mining frequent cross-graph quasi-cliques. Physica A: Statistical Mechanics and its Applications 365(2), 556-564 (2006)
14. Tong, H., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Proximity tracking on time-evolving bipartite graphs. In: SDM, pp. 704-715 (2008)
15. Guha, R.V., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW, pp. 403-412 (2004)
16. Haveliwala, T.H.: Topic-sensitive pagerank. In: WWW, pp. 517-526 (2002)
17. Lin, Z., Lyu, M.R., King, I.: Pagesim: a novel link-based measure of web page aimilarity. In: WWW, pp. 1019-1020 (2006)
18. Baeza-Yates, R.A., Boldi, P., Castillo, C.: Generalizing pagerank: damping functions for link-based ranking algorithms. In: SIGIR, pp. 308-315 (2006)
19. Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. TKDD 2(4) (2009)