{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:12:14Z","timestamp":1761808334585,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No.2018ZZCX14"],"award-info":[{"award-number":["No.2018ZZCX14"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00607-019-00778-5","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T18:03:55Z","timestamp":1578333835000},"page":"427-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A neighbour scale fixed approach for influence maximization in social networks"],"prefix":"10.1007","volume":"102","author":[{"given":"Xiaobin","family":"Rui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"key":"778_CR1","doi-asserted-by":"crossref","unstructured":"Arora A, Galhotra S, Ranu S (2017) Debunking the myths of influence maximization: an in-depth benchmarking study. In: Proceedings of the 2017 ACM international conference on management of data, pp 651\u2013666. ACM","DOI":"10.1145\/3035918.3035924"},{"issue":"6","key":"778_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725\u2013730","journal-title":"J Acoust Soc Am"},{"issue":"3","key":"778_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0378-8733(01)00038-7","volume":"23","author":"P Bonacich","year":"2001","unstructured":"Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Soc Netw 23(3):191\u2013201","journal-title":"Soc Netw"},{"key":"778_CR4","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, pp 946\u2013957. SIAM","DOI":"10.1137\/1.9781611973402.70"},{"issue":"3","key":"778_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0550-3213(03)00355-9","volume":"663","author":"J Bouttier","year":"2003","unstructured":"Bouttier J, Di Francesco P, Guitter E (2003) Geodesic distance in planar graphs. Nucl Phys B 663(3):535\u2013567","journal-title":"Nucl Phys B"},{"key":"778_CR6","doi-asserted-by":"crossref","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi KP (2010) Measuring user influence in twitter: the million follower fallacy. In: ICWSM 2010\u2014proceedings of the 4th international AAAI conference on weblogs and social media, pp 10\u201317","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"778_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199\u2013208. ACM","DOI":"10.1145\/1557019.1557047"},{"issue":"2","key":"778_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2532549","volume":"5","author":"YC Chen","year":"2014","unstructured":"Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5(2):25","journal-title":"ACM Trans Intell Syst Technol"},{"key":"778_CR9","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information and knowledge management, pp 509\u2013518. ACM","DOI":"10.1145\/2505515.2505541"},{"key":"778_CR10","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1082\u20131090. ACM","DOI":"10.1145\/2020408.2020579"},{"issue":"3","key":"778_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1038\/nphys209","volume":"2","author":"V Colizza","year":"2006","unstructured":"Colizza V, Flammini A, Serrano MA, Vespignani A (2006) Detecting rich-club ordering in complex networks. Nat Phys 2(3):110\u2013115","journal-title":"Nat Phys"},{"issue":"502","key":"778_CR12","first-page":"67","volume":"173","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory. Math Gaz 173(502):67\u2013128","journal-title":"Math Gaz"},{"key":"778_CR13","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, pp 57\u201366. ACM","DOI":"10.1145\/502512.502525"},{"issue":"1","key":"778_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"key":"778_CR15","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, pp 47\u201348. ACM","DOI":"10.1145\/1963192.1963217"},{"issue":"6","key":"778_CR16","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"key":"778_CR17","doi-asserted-by":"crossref","unstructured":"Huang J, Cheng XQ, Shen HW, Zhou T, Jin X (2012) Exploring social influence via posterior effect of word-of-mouth recommendations. In: Proceedings of the fifth ACM international conference on web search and data mining, pp 573\u2013582. ACM","DOI":"10.1145\/2124295.2124365"},{"key":"778_CR18","unstructured":"Hamsterster friendships network dataset\u2014konect. http:\/\/konect.uni-koblenz.de\/networks\/petster-friendships-hamster (2017)"},{"key":"778_CR19","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146. ACM","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"778_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"778_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429. ACM","DOI":"10.1145\/1281192.1281239"},{"issue":"10","key":"778_CR22","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"778_CR23","doi-asserted-by":"publisher","first-page":"43330","DOI":"10.1038\/srep43330","volume":"7","author":"D Liu","year":"2017","unstructured":"Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A fast and efficient algorithm for mining top-k nodes in complex networks. Sci Rep 7:43330","journal-title":"Sci Rep"},{"key":"778_CR24","volume-title":"WordNet: an electronic lexical database","author":"G Miller","year":"1998","unstructured":"Miller G (1998) WordNet: an electronic lexical database. MIT Press, Cambridge"},{"issue":"1","key":"778_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"issue":"4","key":"778_CR26","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s11277-016-3939-8","volume":"93","author":"DL Nguyen","year":"2017","unstructured":"Nguyen DL, Nguyen TH, Do TH, Yoo M (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel Pers Commun 93(4):903\u2013916","journal-title":"Wirel Pers Commun"},{"key":"778_CR27","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi Ki (2014) Fast and accurate influence maximization on large networks with pruned Monte\u2013Carlo simulations. In: 28th AAAI conference on artificial intelligence, pp 138\u2013144","DOI":"10.1609\/aaai.v28i1.8726"},{"issue":"1","key":"778_CR28","first-page":"1","volume":"9","author":"L Page","year":"1998","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. Stanf Digit Libr Work Pap 9(1):1\u201314","journal-title":"Stanf Digit Libr Work Pap"},{"key":"778_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: a survey. J Netw Comput Appl 106:17\u201332","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"778_CR30","doi-asserted-by":"publisher","first-page":"012318","DOI":"10.1103\/PhysRevE.95.012318","volume":"95","author":"F Radicchi","year":"2017","unstructured":"Radicchi F, Castellano C (2017) Fundamental difference between superblockers and superspreaders in networks. Phys Rev E 95(1):012318","journal-title":"Phys Rev E"},{"key":"778_CR31","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 61\u201370. ACM","DOI":"10.1145\/775047.775057"},{"key":"778_CR32","doi-asserted-by":"crossref","unstructured":"Ripeanu M, Foster I, Iamnitchi A (2002) Mapping the gnutella network: properties of large-scale peer-to-peer systems and implications for system design. In: IEEE internet computing journal","DOI":"10.1007\/3-540-45748-8_8"},{"key":"778_CR33","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100","journal-title":"Knowl Based Syst"},{"key":"778_CR34","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.physa.2015.04.035","volume":"436","author":"A Sheikhahmadi","year":"2015","unstructured":"Sheikhahmadi A, Nematbakhsh MA, Shokrollahi A (2015) Improving detection of influential nodes in complex networks. Phys A Stat Mech Appl 436:833\u2013845","journal-title":"Phys A Stat Mech Appl"},{"key":"778_CR35","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1539\u20131554. ACM","DOI":"10.1145\/2723372.2723734"},{"key":"778_CR36","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 75\u201386. ACM","DOI":"10.1145\/2588555.2593670"},{"key":"778_CR37","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.physa.2016.05.020","volume":"461","author":"X Wang","year":"2016","unstructured":"Wang X, Su Y, Zhao C, Yi D (2016) Effective identification of multiple influential spreaders by degreepunishment. Phys A Stat Mech Appl 461:238\u2013247","journal-title":"Phys A Stat Mech Appl"},{"key":"778_CR38","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1039\u20131048. ACM","DOI":"10.1145\/1835804.1835935"},{"issue":"6684","key":"778_CR39","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440","journal-title":"Nature"},{"key":"778_CR40","unstructured":"Zafarani R, Liu H (2009) Social computing data repository at ASU. http:\/\/socialcomputing.asu.edu\/datasets\/Douban"},{"issue":"10","key":"778_CR41","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27(10):2770\u20132783","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"778_CR42","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/LCOMM.2004.823426","volume":"8","author":"S Zhou","year":"2004","unstructured":"Zhou S, Mondrag\u00f3n RJ (2004) The rich-club phenomenon in the internet topology. IEEE Commun Lett 8(3):180\u2013182","journal-title":"IEEE Commun Lett"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00778-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-019-00778-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00778-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T19:48:48Z","timestamp":1695584928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-019-00778-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s00607-019-00778-5","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"23 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}