{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:26Z","timestamp":1740099086525,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_20","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T08:57:09Z","timestamp":1526547429000},"page":"249-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Influential Nodes by a Fast Marginal Ranking Method"],"prefix":"10.1007","author":[{"given":"Yipeng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[]},{"given":"Zizhe","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Qizhi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486. IEEE (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"20_CR2","first-page":"946","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christian Borgs","year":"2013","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: SIGKDD, pp. 1029\u20131038. ACM (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM, pp. 88\u201397. IEEE (2010)","DOI":"10.1109\/ICDM.2010.118"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10115-012-0540-7","volume":"33","author":"Y-C Chen","year":"2012","unstructured":"Chen, Y.-C., Peng, W.-C., Lee, S.-Y.: Efficient algorithms for influence maximization in social networks. Knowl. Inf. Syst. 33(3), 577\u2013601 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Gomez Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: SIGKDD, pp. 1019\u20131028. ACM (2010)","DOI":"10.1145\/1835804.1835933"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank: a context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784\u2013796 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279. ACM (2003)","DOI":"10.1145\/775152.775191"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: SIGKDD, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956755.956769"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259\u2013271. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871637_27"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Kurashima, T., Iwata, T., Takaya, N., Sawada, H.: Probabilistic latent network visualization: inferring and embedding diffusion networks. In: SIGKDD, pp. 1236\u20131245. ACM (2014)","DOI":"10.1145\/2623330.2623646"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: SIGKDD, pp. 420\u2013429. ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"20_CR13","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:51:59Z","timestamp":1571359919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}