{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:34Z","timestamp":1763468014332},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208461"},{"type":"electronic","value":"9783642208478"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20847-8_34","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:32:11Z","timestamp":1306488731000},"page":"407-419","source":"Crossref","is-referenced-by-count":4,"title":["Ranking Individuals and Groups by Influence Propagation"],"prefix":"10.1007","author":[{"given":"Pei","family":"Li","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hongyan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"He","sequence":"additional","affiliation":[]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1540276.1540298","volume":"10","author":"H. Zhang","year":"2008","unstructured":"Zhang, H., Smith, M., Giles, C.L., Yen, J., Foley, H.C.: Snakdd 2008 social network mining and analysis report. SIGKDD Explorations\u00a010(2), 74\u201377 (2008)","journal-title":"SIGKDD Explorations"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L.C. Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks: conceptual clarification. Social Networks\u00a01, 215\u2013239 (1978)","journal-title":"Social Networks"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P. Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology\u00a02(1), 113\u2013120 (1972)","journal-title":"Journal of Mathematical Sociology"},{"key":"34_CR4","volume-title":"The New Palgrave Encyclopedia of Economics","author":"M. Newman","year":"2008","unstructured":"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","edition":"2"},{"key":"34_CR5","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (1999)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"key":"34_CR7","first-page":"58","volume-title":"Social network analysis: methods and applications","author":"M.G. Everett","year":"1994","unstructured":"Everett, M.G., Borgatti, S.P.: Extending centrality. In: Wasserman, S., Faust, K. (eds.) Social network analysis: methods and applications, pp. 58\u201363. Cambridge University Press, Cambridge (1994)"},{"key":"34_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"34_CR9","unstructured":"Valente, T.: Network Models of the Diffusion of Innovations. Hampton Press, New Jersey (1995)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.O.: Combating web spam with trustrank. In: VLDB, pp. 576\u2013587 (2004)","DOI":"10.1016\/B978-012088469-8.50052-8"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast dynamic reranking in large graphs. In: WWW, pp. 31\u201340 (2009)","DOI":"10.1145\/1526709.1526715"},{"key":"34_CR12","unstructured":"Centrality in Wikipedia, http:\/\/en.wikipedia.org\/wiki\/Centrality"},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.physa.2005.12.020","volume":"365","author":"C. Dangalchev","year":"2006","unstructured":"Dangalchev, C.: Mining frequent cross-graph quasi-cliques. Physica A: Statistical Mechanics and its Applications\u00a0365(2), 556\u2013564 (2006)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Tong, H., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Proximity tracking on time-evolving bipartite graphs. In: SDM, pp. 704\u2013715 (2008)","DOI":"10.1137\/1.9781611972788.64"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Guha, R.V., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW, pp. 403\u2013412 (2004)","DOI":"10.1145\/988672.988727"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank. In: WWW, pp. 517\u2013526 (2002)","DOI":"10.1145\/511446.511513"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Lin, Z., Lyu, M.R., King, I.: Pagesim: a novel link-based measure of web page aimilarity. In: WWW, pp. 1019\u20131020 (2006)","DOI":"10.1145\/1135777.1135994"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Boldi, P., Castillo, C.: Generalizing pagerank: damping functions for link-based ranking algorithms. In: SIGIR, pp. 308\u2013315 (2006)","DOI":"10.1145\/1148170.1148225"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. TKDD\u00a02(4) (2009)","DOI":"10.1145\/1460797.1460799"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20847-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:08:09Z","timestamp":1560236889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20847-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208461","9783642208478"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20847-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}