{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:14:09Z","timestamp":1740158049286,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004541","name":"MHRD","doi-asserted-by":"crossref","award":["Grant No. F.No.5- 5\/2014-TS.VII."],"award-info":[{"award-number":["Grant No. F.No.5- 5\/2014-TS.VII."]}],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12652-019-01308-z","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T05:50:57Z","timestamp":1557294657000},"page":"2539-2555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing the earned benefit in an incentivized social networking environment: a community-based approach"],"prefix":"10.1007","volume":"11","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamata","family":"Jenamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilip Kumar","family":"Pratihar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,8]]},"reference":[{"issue":"3","key":"1308_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1509\/jmkg.69.3.19.66363","volume":"69","author":"R Algesheimer","year":"2005","unstructured":"Algesheimer R, Dholakia UM, Herrmann A (2005) The social influence of brand community: evidence from european car clubs. J Mark 69(3):19\u201334","journal-title":"J Mark"},{"key":"1308_CR2","doi-asserted-by":"crossref","unstructured":"Alon N, Gamzu I, Tennenholtz M (2012) Optimizing budget allocation among channels and influencers. In: Proceedings of the 21st international conference on World Wide Web, ACM, pp 381\u2013388","DOI":"10.1145\/2187836.2187888"},{"key":"1308_CR3","doi-asserted-by":"crossref","unstructured":"Angell R, Schoenebeck G (2017) Dont be greedy: leveraging community structure to find high quality seed sets for influence maximization. In: International conference on web and internet economics. Springer, pp 16\u201329","DOI":"10.1007\/978-3-319-71924-5_2"},{"issue":"11","key":"1308_CR4","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/3137628.3137635","volume":"10","author":"C Aslay","year":"2017","unstructured":"Aslay C, Bonchi F, Lakshmanan LV, Lu W (2017) Revenue maximization in incentivized social advertising. Proc VLDB Endow 10(11):1238\u20131249","journal-title":"Proc VLDB Endow"},{"key":"1308_CR5","doi-asserted-by":"crossref","unstructured":"Bakshy E, Rosenn I, Marlow C, Adamic L (2012) The role of social networks in information diffusion. In: Proceedings of the 21st international conference on World Wide Web, ACM, pp 519\u2013528","DOI":"10.1145\/2187836.2187907"},{"key":"1308_CR6","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2018a) A survey on influence maximization in a social network. arXiv preprint \narXiv:180805502"},{"key":"1308_CR7","first-page":"717","volume-title":"Advances in Intelligent Systems and Computing","author":"Suman Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK, Sirohi A (2018b) A priority-based ranking approach for maximizing the earned benefit in an incentivized social network. In: International conference on intelligent systems design and applications. Springer, Berlin, pp 717\u2013726"},{"key":"1308_CR8","doi-asserted-by":"crossref","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) Maximizing the earned benefit in an incentivized social networking environment: An integer programming-based approach. In: Proceedings of the ACM India joint international conference on data science and management of data, ACM, pp 322\u2013325","DOI":"10.1145\/3297001.3297051"},{"issue":"6","key":"1308_CR9","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199","journal-title":"Inf Process Manag"},{"key":"1308_CR10","doi-asserted-by":"crossref","unstructured":"Cali\u00f2 A, Interdonato R, Pulice C, Tagarelli A (2018) Topology-driven diversity for targeted influence maximization with application to user engagement in social networks. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2018.2820010"},{"key":"1308_CR11","doi-asserted-by":"crossref","unstructured":"Cha M, Mislove A, Gummadi KP (2009) A measurement-driven analysis of information propagation in the flickr social network. In: Proceedings of the 18th international conference on World wide web, ACM, pp 721\u2013730","DOI":"10.1145\/1526709.1526806"},{"key":"1308_CR12","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 the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1308_CR13","unstructured":"Chen Y, Chang S, Chou C, Peng W, Lee S (2012) Exploring community structures for influence maximization in social networks. In: Proceedings of the 6th SNA-KDD Workshop on social network mining and analysis held in conjunction with KDD12 (SNA-KDD12), pp 1\u20136"},{"issue":"2","key":"1308_CR14","first-page":"25","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 Technolgy (TIST) 5(2):25","journal-title":"ACM Trans Intell Syst Technolgy (TIST)"},{"key":"1308_CR15","first-page":"17","volume":"12","author":"C Cheng","year":"2012","unstructured":"Cheng C, Yang H, King I, Lyu MR (2012) Fused matrix factorization with geographical and social influence in location-based social networks. Aaai 12:17\u201323","journal-title":"Aaai"},{"key":"1308_CR16","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, ACM, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"1308_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, Lu N (2018) Ddse: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130","journal-title":"J Netw Comput Appl"},{"issue":"3","key":"1308_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ijresmar.2008.03.004","volume":"25","author":"A De Bruyn","year":"2008","unstructured":"De Bruyn A, Lilien GL (2008) A multi-stage model of word-of-mouth influence through viral marketing. Int J Res Mark 25(3):151\u2013163","journal-title":"Int J Res Mark"},{"issue":"6","key":"1308_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2184319.2184338","volume":"55","author":"B Doerr","year":"2012","unstructured":"Doerr B, Fouz M, Friedrich T (2012) Why rumors spread so quickly in social networks. Commun ACM 55(6):70\u201375","journal-title":"Commun ACM"},{"key":"1308_CR20","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, ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"1308_CR21","doi-asserted-by":"crossref","unstructured":"Goel S, Watts DJ, Goldstein DG (2012) The structure of online diffusion networks. In: Proceedings of the 13th ACM conference on electronic commerce, ACM, pp 623\u2013638","DOI":"10.1145\/2229012.2229058"},{"key":"1308_CR22","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011a) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1308_CR23","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining (ICDM), IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1308_CR24","unstructured":"G\u00fcney E (2017) On the optimal solution of budgeted influence maximization problem in social networks. Oper Res 1\u201315"},{"key":"1308_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06608-0_6","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Shuo Han","year":"2014","unstructured":"Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 65\u201377"},{"key":"1308_CR26","first-page":"447","volume-title":"Advances in Intelligent Systems and Computing","author":"Ragia A. Ibrahim","year":"2016","unstructured":"Ibrahim RA, Hefny HA, Hassanien AE (2016) Group impact: local influence maximization in social networks. In: International conference on advanced intelligent systems and informatics. Springer, Berlin, pp 447\u2013455"},{"key":"1308_CR27","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: Scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining (ICDM), IEEE, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1308_CR28","doi-asserted-by":"crossref","unstructured":"Ke X, Khan A, Cong G (2018) Finding seeds and relevant tags jointly: For targeted influence maximization in social networks. In: Proceedings of the 2018 international conference on management of data, ACM, pp 1097\u20131111","DOI":"10.1145\/3183713.3199670"},{"key":"1308_CR29","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, ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1308_CR30","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539\u2013547"},{"issue":"12","key":"1308_CR31","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.3390\/s18124486","volume":"18","author":"M Li","year":"2018","unstructured":"Li M, Sun Y, Jiang Y, Tian Z (2018a) Answering the min-cost quality-aware query on multi-sources in sensor-cloud systems. Sensors 18(12):4486","journal-title":"Sensors"},{"key":"1308_CR32","doi-asserted-by":"crossref","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018b) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2018.2807843"},{"issue":"1","key":"1308_CR33","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"6","key":"1308_CR34","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 Select Areas Commun 31(6):1084\u20131094","journal-title":"IEEE J Select Areas Commun"},{"key":"1308_CR35","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data, ACM, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"4","key":"1308_CR36","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen HT, Thai MT, Dinh TN (2017) A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans Netw (TON) 25(4):2419\u20132429","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"issue":"5","key":"1308_CR37","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s12652-017-0552-y","volume":"8","author":"Y Ni","year":"2017","unstructured":"Ni Y, Shi Q, Wei Z (2017) Optimizing influence diffusion in a social network with fuzzy costs for targeting nodes. J Ambient Intell Hum Comput 8(5):819\u2013826","journal-title":"J Ambient Intell Hum Comput"},{"issue":"14","key":"1308_CR38","doi-asserted-by":"publisher","first-page":"2849","DOI":"10.1016\/j.physa.2010.03.006","volume":"389","author":"Y Pan","year":"2010","unstructured":"Pan Y, Li DH, Liu JG, Liang JZ (2010) Detecting community structure in complex networks via node similarity. Phys A Stat Mech Appl 389(14):2849\u20132857","journal-title":"Phys A Stat Mech Appl"},{"key":"1308_CR39","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, ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1308_CR40","first-page":"351","volume-title":"Lecture Notes in Computer Science","author":"Matthew Richardson","year":"2003","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: International semantic web conference. Springer, Berlin, pp 351\u2013368"},{"key":"1308_CR41","unstructured":"Samper JJ, Castillo PA, Araujo L, Merelo J (2006) Nectarss, an rss feed ranking system that implicitly learns user preferences. arXiv preprint \narXiv:cs\/0610019"},{"key":"1308_CR42","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"},{"issue":"2","key":"1308_CR43","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/asi.23931","volume":"69","author":"S Su","year":"2018","unstructured":"Su S, Li X, Cheng X, Sun C (2018) Location-aware targeted influence maximization in social networks. J Assoc Inf Sci Technol 69(2):229\u2013241","journal-title":"J Assoc Inf Sci Technol"},{"key":"1308_CR44","doi-asserted-by":"crossref","unstructured":"Tan Q, Gao Y, Shi J, Wang X, Fang B, Tian ZH (2018) Towards a comprehensive insight into the eclipse attacks of tor hidden services. IEEE Internet Things J","DOI":"10.1109\/ICC.2017.7996832"},{"issue":"1","key":"1308_CR45","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018a) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10","journal-title":"Soc Netw Anal Min"},{"key":"1308_CR46","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y, Zhao Z, Wang P, Li H, Yuan J (2018b) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl Based Syst 160:88\u2013103","journal-title":"Knowl Based Syst"},{"key":"1308_CR47","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, ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"1308_CR48","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, ACM, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"1308_CR49","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.future.2018.12.054","volume":"95","author":"Z Tian","year":"2019","unstructured":"Tian Z, Su S, Shi W, Du X, Guizani M, Yu X (2019) A data-driven method for future internet route decision modeling. Future Gen Comput Syst 95:212\u2013220","journal-title":"Future Gen Comput Syst"},{"issue":"3","key":"1308_CR50","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowle Discov 25(3):545\u2013576","journal-title":"Data Min Knowle Discov"},{"key":"1308_CR51","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-319-93040-4_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Xinjue Wang","year":"2018","unstructured":"Wang X, Deng K, Li J, Yu JX, Jensen CS, Yang X (2018) Targeted influence minimization in social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 689\u2013700"},{"key":"1308_CR52","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, ACM, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"key":"1308_CR53","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-319-93040-4_55","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Yu-Ting Wen","year":"2018","unstructured":"Wen YT, Peng WC, Shuai HH (2018) Maximizing social influence on target users. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 701\u2013712"},{"key":"1308_CR54","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, ACM, pp 671\u2013680","DOI":"10.1145\/2348283.2348373"},{"key":"1308_CR55","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.physa.2017.02.067","volume":"478","author":"K Zhang","year":"2017","unstructured":"Zhang K, Du H, Feldman MW (2017) Maximizing influence in a social network: Improved results using a genetic algorithm. Phys A Stat Mech Appl 478:20\u201330","journal-title":"Phys A Stat Mech Appl"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01308-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-019-01308-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01308-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T17:11:57Z","timestamp":1590858717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-019-01308-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,8]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1308"],"URL":"https:\/\/doi.org\/10.1007\/s12652-019-01308-z","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2019,5,8]]},"assertion":[{"value":"16 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}