{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:55Z","timestamp":1740160315905,"version":"3.37.3"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13278-019-0598-2","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T12:38:27Z","timestamp":1572007107000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Influence maximization in graph-based OLAP (GOLAP)"],"prefix":"10.1007","volume":"9","author":[{"given":"Jenny","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guigang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2036-850X","authenticated-orcid":false,"given":"Phillip","family":"Sheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Hayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Kitazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"598_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal N, Liu H, Tang L, Yu PS (2008) Identifying the influential bloggers in a community. In: WSDM\u201908, pp 207\u2013217","DOI":"10.1145\/1341531.1341559"},{"key":"598_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aml.2011.06.008","volume":"25","author":"A Aini","year":"2012","unstructured":"Aini A, Salehipour A (2012) Speeding up the Floyd\u2013Warshall algorithm for the cycled shortest path problem. Appl Math Lett 25:1","journal-title":"Appl Math Lett"},{"key":"598_CR3","doi-asserted-by":"crossref","unstructured":"Alshawi IS, Yan L, Pan W, Luo B (2012) Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. In: IET Conference on wireless sensor systems","DOI":"10.1049\/cp.2012.0611"},{"key":"598_CR4","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Kumar R, Mahdian M (2008) Influence and correlation in social networks. In: KDD\u201908, pp 7\u201315","DOI":"10.1145\/1401890.1401897"},{"issue":"12","key":"598_CR5","first-page":"889","volume":"4","author":"T Arif","year":"2015","unstructured":"Arif T (2015) The mathematics of social network analysis: metrics for academic social networks. Int J Comput Appl Technol Res 4(12):889\u2013893","journal-title":"Int J Comput Appl Technol Res"},{"key":"598_CR6","doi-asserted-by":"crossref","unstructured":"Bao Y, Wang X, Wang Z, Wu C, Lau FCM (2016) Online influence maximization in non-stationary social networks. In: 2016 IEEE\/ACM 24th international symposium on quality of service (IWQoS), Beijing, pp 1\u20136","DOI":"10.1109\/IWQoS.2016.7590438"},{"key":"598_CR7","unstructured":"Bruckman A (2015) Influence maximization in social networks: considering both positive and negative relationships. In: 2015 International conference on collaboration technologies and systems (CTS), Atlanta, GA, pp 479\u2013480"},{"key":"598_CR8","doi-asserted-by":"crossref","unstructured":"Cai JLZ, Yan M, Li Y (2016) Using crowdsourced data in location-based social networks to explore influence maximization. In: IEEE INFOCOM 2016\u2014the 35th annual IEEE international conference on computer communications, San Francisco, CA, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524471"},{"key":"598_CR9","doi-asserted-by":"crossref","unstructured":"Chang CW, Yeh MY, Chuang KT (2015) On influence maximization to target users in the presence of multiple acceptances. In: 2015 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), Paris, pp 1592\u20131593","DOI":"10.1145\/2808797.2809349"},{"key":"598_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of international conference on Knowledge discovery and data mining, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"598_CR11","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining, Sydney, NSW, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"598_CR12","doi-asserted-by":"crossref","unstructured":"Cheng C, Riley R, Kumar SPR, Garcia-Luna-Aceves JJ (1989) A loop-free extended Bellman\u2013Ford routing protocol without bouncing effect. In: Proceedings of symposium proceedings on communications architectures & protocols, pp 224\u2013236","DOI":"10.1145\/75246.75269"},{"key":"598_CR13","doi-asserted-by":"crossref","unstructured":"Chou B, Kim M (2018) Graph online analytical processing. In: Encyclopedia with semantic computing","DOI":"10.1142\/S1793351X18500071"},{"key":"598_CR14","doi-asserted-by":"crossref","unstructured":"Cohen E (2016) Greedy maximization framework for graph-based influence functions. In: 2016 Fourth IEEE workshop on hot topics in web systems and technologies (HotWeb), Washington, DC, pp 29\u201335","DOI":"10.1109\/HotWeb.2016.14"},{"key":"598_CR15","doi-asserted-by":"crossref","unstructured":"Deng X, Pan Y, Wu Y, Gui J (2015) Credit distribution and influence maximization in online social networks using node features. In: 2015 12th international conference on fuzzy systems and knowledge discovery (FSKD), Zhangjiajie, pp 2093\u20132100","DOI":"10.1109\/FSKD.2015.7382274"},{"key":"598_CR16","doi-asserted-by":"crossref","unstructured":"Dong X, Qian L, Huang L (2017) Short-term load forecasting in smart grid: a combined CNN and k-means clustering approach. In: 2017 IEEE international conference on big data and smart computing (BigComp), Jeju, pp 119\u2013125","DOI":"10.1109\/BIGCOMP.2017.7881726"},{"key":"598_CR17","doi-asserted-by":"crossref","unstructured":"Fan Z, Sun Y (2016) Clustering of college students based on improved k-means algorithm. In: 2016 International computer symposium (ICS), Chiayi, pp 676\u2013679","DOI":"10.1109\/ICS.2016.0139"},{"issue":"3","key":"598_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Song C, Duan C, Ma L, Shen B (2016) An efficient memetic algorithm for influence maximization in social networks. IEEE Comput Intell Mag 11(3):22\u201333","journal-title":"IEEE Comput Intell Mag"},{"key":"598_CR19","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2008) Discovering leaders from community actions. In: CIKM\u201908, pp 499\u2013508","DOI":"10.1145\/1458082.1458149"},{"key":"598_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: WSDM\u201910, pp 207\u2013217","DOI":"10.1145\/1718487.1718518"},{"key":"598_CR21","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining, Vancouver, BC, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"598_CR22","doi-asserted-by":"crossref","unstructured":"Gu L (2016) A novel locality sensitive k-means clustering algorithm based on subtractive clustering. In: 2016 7th IEEE international conference on software engineering and service science (ICSESS), Beijing, pp 836\u2013839","DOI":"10.1109\/ICSESS.2016.7883196"},{"key":"598_CR23","doi-asserted-by":"crossref","unstructured":"Han M, Li J, Cai Z, Han Q (2016) Privacy reserved influence maximization in GPS-enabled cyber-physical and online social networks. In: 2016 IEEE international conferences on big data and cloud computing (BDCloud), social computing and networking (SocialCom), sustainable computing and communications (SustainCom) (BDCloud-SocialCom-SustainCom), Atlanta, GA, pp 284\u2013292","DOI":"10.1109\/BDCloud-SocialCom-SustainCom.2016.51"},{"key":"598_CR24","unstructured":"Hangal S, Maclean D, Lam MS, Heer J (2010) All friends are not equal: using weights in social graphs to improve search. In: Proceedings of the 4th SNA-KDD workshop\u201910 (SNA-KDD\u201910). ACM, Washington"},{"key":"598_CR25","doi-asserted-by":"crossref","unstructured":"Hao F, Zhu C, Chen M, Yang LT, Pei Z (2011) Influence strength aware diffusion models for dynamic influence maximization in social networks. In: 2011 International conference on internet of things and 4th international conference on cyber, physical and social computing, Dalian, pp 317\u2013322","DOI":"10.1109\/iThings\/CPSCom.2011.164"},{"issue":"3","key":"598_CR26","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TCSVT.2016.2620152","volume":"28","author":"H Hu","year":"2018","unstructured":"Hu H, Wen Y, Feng S (2018) Budget-efficient viral video distribution over online social networks: mining topic-aware influential users. IEEE Trans Circuits Syst Video Technol 28(3):759\u2013771","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"598_CR27","doi-asserted-by":"crossref","unstructured":"Jiang F, Jin S, Wu Y, Xu J (2014) A uniform framework for community detection via influence maximization in social networks. In: 2014 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM 2014), Beijing, pp 27\u201332","DOI":"10.1109\/ASONAM.2014.6921556"},{"key":"598_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/321765.321768","volume":"20","author":"DB Johnson","year":"1973","unstructured":"Johnson DB (1973) A note on Dijkstra\u2019s shortest path algorithm. J ACM 20:3","journal-title":"J ACM"},{"key":"598_CR29","unstructured":"Kang C, Mlinaro C, Kraus S, Shavit Y, Subrahmanian VS (2012) In: IEEE\/ACM international conference on advances in social networks analysis and mining, Turkey"},{"issue":"4","key":"598_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg J, Tardos E (2015) Maximizing the spread of influence through a social network. Proc Theory Comput 11(4):105\u2013147","journal-title":"Proc Theory Comput"},{"key":"598_CR31","doi-asserted-by":"crossref","unstructured":"Kr\u00f3l D (2014) On modelling social propagation phenomenon. In: Asian conference on intelligent information and database systems, pp 227\u2013236","DOI":"10.1007\/978-3-319-05458-2_24"},{"key":"598_CR32","doi-asserted-by":"crossref","unstructured":"Kumari A, Singh SN (2017) Online influence maximization using rapid continuous time independent cascade model. In: 2017 7th international conference on cloud computing, data science & engineering\u2014confluence, Noida, India, pp 356\u2013361","DOI":"10.1109\/CONFLUENCE.2017.7943175"},{"key":"598_CR33","doi-asserted-by":"crossref","unstructured":"Kwak B, Song N, Miller LE (2005) Performance analysis of exponential backoff. In: Proceedings of 2005 IEEE\/ACM transactions on networking, vol 13, no 2","DOI":"10.1109\/TNET.2005.845533"},{"issue":"2","key":"598_CR34","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"JR Lee","year":"2015","unstructured":"Lee JR, Chung CW (2015) A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27(2):340\u2013353","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"598_CR35","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"598_CR36","doi-asserted-by":"crossref","unstructured":"Li J, Yu Y (2012) Scalable influence maximization in social networks using the community discovery algorithm. In: 2012 Sixth international conference on genetic and evolutionary computing, Kitakushu, pp 284\u2013287","DOI":"10.1109\/ICGEC.2012.127"},{"key":"598_CR37","unstructured":"Li P, Li Z, He J, Du X, Liu H (2009) Assessing the influence probability between objects: a random walker approach. In: 2009 IEEE symposium on computational intelligence and data mining, Nashville, TN, pp 25\u201332"},{"key":"598_CR38","unstructured":"Li FH, Li CT, Shan MK (2011) Labeled influence maximization in social networks for target marketing. In: 2011 IEEE third international conference on privacy, security, risk and trust and 2011 IEEE third international conference on social computing, Boston, MA, pp 560\u2013563"},{"key":"598_CR39","doi-asserted-by":"crossref","unstructured":"Li S, Zhu Y, Li D, Kim D, Ma H, Huang H (2014) Influence maximization in social networks with user attitude modification. In: 2014 IEEE international conference on communications (ICC), Sydney, NSW, pp 3913\u20133918","DOI":"10.1109\/ICC.2014.6883932"},{"key":"598_CR40","doi-asserted-by":"crossref","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining, Brussels, pp 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"issue":"8","key":"598_CR41","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu B, Cong G, Zeng Y, Xu D, Chee YM (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26(8):1904\u20131917","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"598_CR42","doi-asserted-by":"publisher","first-page":"13172","DOI":"10.1038\/srep13172","volume":"5","author":"Y Liu","year":"2015","unstructured":"Liu Y, Tang M, Zhou T, Do Y (2015) Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci Rep 5:13172","journal-title":"Sci Rep"},{"key":"598_CR43","doi-asserted-by":"crossref","unstructured":"Lou T, Tang J, Hopcroft J, Fang Z, Ding X (2013) Learning to predict reciprocity and triadic closure in social networks. In: TKDD, vol 7, no 2","DOI":"10.1145\/2499907.2499908"},{"key":"598_CR44","doi-asserted-by":"crossref","unstructured":"Lu Z, Zhang W, Wu W, Fu B, Du D (2011) Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: 2011 31st international conference on distributed computing systems workshops, Minneapolis, MN, pp 160\u2013165","DOI":"10.1109\/ICDCSW.2011.33"},{"key":"598_CR45","unstructured":"Lu J, Wei L, Yeh MY (2014) Influence maximization in a social network in the presence of multiple influences and acceptances. In: 2014 International conference on data science and advanced analytics (DSAA), Shanghai, pp 230\u2013236"},{"key":"598_CR46","doi-asserted-by":"crossref","unstructured":"Lu Z, Long Y, Li VOK (2015) Cascade with varying activation probability model for influence maximization in social networks. In: 2015 International conference on computing, networking and communications (ICNC), Garden Grove, CA, pp 869\u2013873","DOI":"10.1109\/ICCNC.2015.7069460"},{"key":"598_CR47","doi-asserted-by":"crossref","unstructured":"Maghami M, Sukthankar G (2013) Hierarchical influence maximization for advertising in multi-agent markets. In: 2013 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM 2013), Niagara Falls, ON, pp 21\u201327","DOI":"10.1145\/2492517.2492622"},{"key":"598_CR48","doi-asserted-by":"crossref","unstructured":"Mihara S, Tsugawa S, Ohsaki H (2015) Influence maximization problem for unknown social networks. In: 2015 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), Paris, pp 1539\u20131546","DOI":"10.1145\/2808797.2808885"},{"key":"598_CR49","first-page":"60","volume":"2","author":"S Milgram","year":"1967","unstructured":"Milgram S (1967) The small world problem. Psychol Today 2:60\u201367","journal-title":"Psychol Today"},{"key":"598_CR50","doi-asserted-by":"crossref","unstructured":"Miller JC, Rae G, Schaefer F, Ward LA, LoFaro T, Farahat A (2001) Modifications of Kleinberg\u2019s HITS algorithm using matrix exponentiation and web log records. In: Proceedings of the 24th annual international ACM SIGIR conference on research and development in information retrieval, systems engineering-theory & practice","DOI":"10.1145\/383952.384086"},{"key":"598_CR51","doi-asserted-by":"crossref","unstructured":"Mohan A, Kunnakadan S, Neelakantan B, Jayakumar A, Salim H (2016) A scalable model for efficient information diffusion in large real world networks. In: 2016 International conference on next generation intelligent systems (ICNGIS), Kottayam, pp 1\u20136","DOI":"10.1109\/ICNGIS.2016.7854070"},{"key":"598_CR52","doi-asserted-by":"crossref","unstructured":"Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In SIGMOD","DOI":"10.1145\/1376616.1376661"},{"key":"598_CR53","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2005) A measure of betweenness centrality based on random walks. In: Social networks, vol 27, no 1, pp 39\u201354","DOI":"10.1016\/j.socnet.2004.11.009"},{"issue":"6","key":"598_CR54","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084\u20131094","journal-title":"IEEE J Sel Areas Commun"},{"key":"598_CR55","doi-asserted-by":"crossref","unstructured":"Nguyen DT, Das S, Thai MT (2013) Influence maximization in multiple online social networks. In: 2013 IEEE global communications conference (GLOBECOM), Atlanta, GA, pp 3060\u20133065","DOI":"10.1109\/GLOCOM.2013.6831541"},{"key":"598_CR56","doi-asserted-by":"crossref","unstructured":"Ok J, Jin Y, Choi J, Shin J, Yi Y (2014) Influence maximization over strategic diffusion in social networks. In: 2014 48th annual conference on information sciences and systems (CISS), Princeton, NJ, pp 1\u20135","DOI":"10.1109\/CISS.2014.6814155"},{"issue":"6","key":"598_CR57","doi-asserted-by":"publisher","first-page":"3798","DOI":"10.1109\/TNET.2016.2556719","volume":"24","author":"J Ok","year":"2016","unstructured":"Ok J, Jin Y, Shin Y, Yi Y (2016) On maximizing diffusion speed over social networks with strategic users. IEEE\/ACM Trans Netw 24(6):3798\u20133811","journal-title":"IEEE\/ACM Trans Netw"},{"key":"598_CR58","unstructured":"Page L, Brin A, Motwani E, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical Report SIDL-WP-1999-0120, Stanford University"},{"key":"598_CR59","doi-asserted-by":"crossref","unstructured":"Pan J, Jiang F, Xu J (2016) Influence maximization in social networks based on non-backtracking random walk. In: 2016 IEEE first international conference on data science in cyberspace (DSC), Changsha, pp 260\u2013267","DOI":"10.1109\/DSC.2016.114"},{"key":"598_CR60","doi-asserted-by":"crossref","unstructured":"Purnawansyah H (2016) K-Means clustering implementation in network traffic activities. In: 2016 International conference on computational intelligence and cybernetics, Makassar, pp 51\u201354","DOI":"10.1109\/CyberneticsCom.2016.7892566"},{"key":"598_CR61","doi-asserted-by":"crossref","unstructured":"Qiang H, Yan G (2012) A method of personalized recommendation based on multi-label propagation for overlapping community detection. In: 2012 3rd international conference on system science, engineering design and manufacturing informatization, Chengdu, pp 360\u2013364","DOI":"10.1109\/ICSSEM.2012.6340748"},{"key":"598_CR62","doi-asserted-by":"crossref","unstructured":"Rahaman I, Hosein P (2016) On the multi-stage influence maximization problem. In: 2016 IEEE Latin American conference on computational intelligence (LA-CCI), Cartagena, pp 1\u20136","DOI":"10.1109\/LA-CCI.2016.7885722"},{"key":"598_CR63","doi-asserted-by":"crossref","unstructured":"Srinivasan BV, Anandhavelu N, Dalal A, Yenugula M, Srikanthan P, Layek A (2014) Topic-based targeted influence maximization. In: 2014 Sixth international conference on communication systems and networks (COMSNETS), Bangalore, pp 1\u20136","DOI":"10.1109\/COMSNETS.2014.6734935"},{"key":"598_CR64","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-1-4419-8462-3_7","volume-title":"Social network data analytics","author":"J Sun","year":"2011","unstructured":"Sun J, Tang J (2011) A survey of models and algorithms for social influence analysis. In: Aggarwal CC (ed) Social network data analytics. Kluwer Academic Publishers, Dordrecht, pp 177\u2013214"},{"key":"598_CR65","doi-asserted-by":"crossref","unstructured":"Tan C, Lee L, Tang J, Jiang L, Zhou M, Li P (2011) User-level sentiment analysis incorporating social networks. InL KDD\u201911, pp 1397\u20131405","DOI":"10.1145\/2020408.2020614"},{"key":"598_CR66","doi-asserted-by":"crossref","unstructured":"Tang J, Sun J (2014) Models and algorithms for social influence analysis. In: WWW\u20192014 (Tutorial)","DOI":"10.1145\/2567948.2577273"},{"key":"598_CR67","doi-asserted-by":"crossref","unstructured":"Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: KDD\u201909, pp 807\u2013816","DOI":"10.1145\/1557019.1557108"},{"key":"598_CR68","doi-asserted-by":"crossref","unstructured":"Tejaswi V, Bindu PV, Thilagam PS (2016) Diffusion models and approaches for influence maximization in social networks. In: International conference on advances in computing, communications and informatics (ICACCI), Jaipur, pp 1345\u20131351","DOI":"10.1109\/ICACCI.2016.7732235"},{"key":"598_CR69","doi-asserted-by":"crossref","unstructured":"Tejaswi V, Bindu PV, Thilagam PS (2017) Target specific influence maximization: an approach to maximize adoption in labeled social networks. In: 2017 9th international conference on communication systems and networks (COMSNETS), Bengaluru, India, pp 542\u2013547","DOI":"10.1109\/COMSNETS.2017.7945450"},{"key":"598_CR70","doi-asserted-by":"crossref","unstructured":"Toivonen H, Zhou F, Hartikainen A, Hinkka A (2011) Compression of weighted graphs. In: KDD","DOI":"10.1145\/2020408.2020566"},{"issue":"1","key":"598_CR71","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong G, Wu W, Tang S, Du DZ (2017) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw 25(1):112\u2013125","journal-title":"IEEE\/ACM Trans Netw"},{"key":"598_CR72","doi-asserted-by":"publisher","first-page":"056101","DOI":"10.1103\/PhysRevA.64.056101","volume":"64","author":"F Wang","year":"2001","unstructured":"Wang F, Landau DP (2001) Determining the density of states for classical statistical models: a random walk algorithm to produce a flat histogram. Phys Rev 64:056101","journal-title":"Phys Rev"},{"key":"598_CR73","first-page":"1600","volume":"15","author":"J Wang","year":"2011","unstructured":"Wang J, Wu X, Yan B, Guo J (2011) Improved method of node importance evaluation based on node contraction in complex networks. Proc CEIS 15:1600\u20131604","journal-title":"Proc CEIS"},{"key":"598_CR74","doi-asserted-by":"crossref","unstructured":"Wang F, Xu K, Wang H (2012) Discovering shared interests in online social networks. In: 2012 32nd international conference on distributed computing systems workshops, Macau, China, pp 163\u2013168","DOI":"10.1109\/ICDCSW.2012.15"},{"key":"598_CR75","doi-asserted-by":"crossref","unstructured":"Wang X, Zhang Y, Zhang W, Lin X, Chen C (2017) Bring order into the samples: a novel scalable method for influence maximization (extended abstract). In: 2017 IEEE 33rd international conference on data engineering (ICDE), San Diego, CA, pp 55\u201356","DOI":"10.1109\/ICDE.2017.34"},{"issue":"2","key":"598_CR76","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S1793351X18500010","volume":"12","author":"S Wang","year":"2018","unstructured":"Wang S, Zhang G, Sheu P (2018) A semantic approach to data reduction for weighted graphs and complex queries. Int J Semant Comput 12(2):287\u2013312","journal-title":"Int J Semant Comput"},{"key":"598_CR77","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\u2019small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"598_CR78","doi-asserted-by":"crossref","unstructured":"Weng X, Liu Z, Li Z (2016) An efficient influence maximization algorithm considering both positive and negative relationships. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, Tianjin, pp 1931\u20131936","DOI":"10.1109\/TrustCom.2016.0295"},{"issue":"2","key":"598_CR79","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TPWRD.2015.2479941","volume":"32","author":"TS Xu","year":"2017","unstructured":"Xu TS, Chiang HD, Liu GY, Tan CW (2017) Hierarchical K-means method for clustering large-scale advanced metering infrastructure data. IEEE Trans Power Deliv 32(2):609\u2013616","journal-title":"IEEE Trans Power Deliv"},{"key":"598_CR80","doi-asserted-by":"crossref","unstructured":"Yellakuor BE, Zhen Q, Hu X, Zhiguang Q (2015) Exploring online social networks for influence maximization. In: 2015 International conference and workshop on computing and communication (IEMCON), Vancouver, BC, pp 1\u20137","DOI":"10.1109\/IEMCON.2015.7344532"},{"key":"598_CR81","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the K shortest loopless paths in a network. Manage Sci 17:712\u2013716","journal-title":"Manage Sci"},{"key":"598_CR82","doi-asserted-by":"crossref","unstructured":"Yesilbudak M (2016) Clustering analysis of multidimensional wind speed data using k-means approach. In: 2016 IEEE international conference on renewable energy research and applications (ICRERA), Birmingham, pp 961\u2013965","DOI":"10.1109\/ICRERA.2016.7884477"},{"issue":"2","key":"598_CR83","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1049\/cje.2016.03.008","volume":"25","author":"M Yu","year":"2016","unstructured":"Yu M, Yang W, Wang W, Shen G, Dong G, Gong L (2016) UGGreedy: influence maximization for user group in microblogging. Chin J Electron 25(2):241\u2013248","journal-title":"Chin J Electron"},{"key":"598_CR84","unstructured":"Zargariasl H (2015) Finding social rules among objects in the social internet of things. Ph.D. Diss., Mediterranea University of Reggio Calabria, 2015, S.S.D. ING-INF\/03 XXVII cycle"},{"key":"598_CR85","unstructured":"Zhang J, Liu B, Tang J, Chen T, Li J (2013) Social influence locality for modeling retweeting behaviors. In: IJCAI\u201913, pp 2761\u20132767"},{"issue":"2","key":"598_CR86","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TNET.2015.2394793","volume":"24","author":"H Zhang","year":"2016","unstructured":"Zhang H, Nguyen DT, Zhang H, Thai MT (2016a) Least cost influence maximization across multiple social networks. IEEE\/ACM Trans Netw 24(2):929\u2013939","journal-title":"IEEE\/ACM Trans Netw"},{"key":"598_CR87","doi-asserted-by":"crossref","unstructured":"Zhang H, Zhang H, Kuhnle A, Thai MT (2016) Profit maximization for multiple products in online social networks. In: IEEE INFOCOM 2016\u2014the 35th annual IEEE international conference on computer communications, San Francisco, CA, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"598_CR88","doi-asserted-by":"crossref","unstructured":"Zhang Y, Bai Y, Chen L, Bian K, Li X (2016) Influence maximization in messenger-based social networks. In: 2016 IEEE global communications conference (GLOBECOM), Washington, DC, pp 1\u20136","DOI":"10.1109\/GLOCOM.2016.7841900"},{"key":"598_CR89","doi-asserted-by":"crossref","unstructured":"Zhang G, Li S, Wang J, Liu P, Chen Y, Luo Y (2017) New influence maximization algorithm research in big graph. In: 14th Web information systems and applications conference (WISA)","DOI":"10.1109\/WISA.2017.50"},{"key":"598_CR90","doi-asserted-by":"crossref","unstructured":"Zhao J, Liu Q, Wang L, Wang X (2015) Relative influence maximization in competitive dynamics on complex networks. In: 2015 54th IEEE conference on decision and control (CDC), Osaka, pp 6583\u20136588","DOI":"10.1109\/CDC.2015.7403256"},{"key":"598_CR91","doi-asserted-by":"crossref","unstructured":"Zhou S, Yue K, Fang Q, Zhu Y, Liu W (2014) An efficient algorithm for influence maximization under linear threshold model. In: The 26th Chinese control and decision conference, Changsha, pp 5352\u20135357","DOI":"10.1109\/CCDC.2014.6852220"},{"key":"598_CR92","doi-asserted-by":"crossref","unstructured":"Zhuang H, Sun Y, Tang J, Zhang J, Sun X (2013) Influence maximization in dynamic social networks. In: 2013 IEEE 13th international conference on data mining, Dallas, TX, pp 1313\u20131318","DOI":"10.1109\/ICDM.2013.145"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-019-0598-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-019-0598-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-019-0598-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T02:49:52Z","timestamp":1611629392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-019-0598-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":92,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["598"],"URL":"https:\/\/doi.org\/10.1007\/s13278-019-0598-2","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2019,9,26]]},"assertion":[{"value":"22 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"54"}}