{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T03:39:41Z","timestamp":1767065981807},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T00:00:00Z","timestamp":1660608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T00:00:00Z","timestamp":1660608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01342-3","type":"journal-article","created":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T03:26:08Z","timestamp":1660620368000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Promotional Predictive Marketing: User Centric Data Driven Approach"],"prefix":"10.1007","volume":"3","author":[{"given":"Soumi","family":"Tokdar","sequence":"first","affiliation":[]},{"given":"Ananya","family":"Kanjilal","sequence":"additional","affiliation":[]},{"given":"Sankhayan","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"Swapan","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"issue":"2","key":"1342_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TCSS.2018.2831694","volume":"5","author":"N Alduaiji","year":"2018","unstructured":"Alduaiji N, Datta A, Li J. Influence propagation model for clique-based community detection in social networks, digital object identifier. IEEE Trans Comput Soc Syst. 2018;5(2):563\u201375. https:\/\/doi.org\/10.1109\/TCSS.2018.2831694.","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1342_CR2","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.knosys.2018.10.020","volume":"163","author":"ZZ Alp","year":"2019","unstructured":"Alp ZZ, \u015eule G\u00fcnd\u00fcz \u00d6. Influence factorization for identifying authorities in Twitter. Knowl Based Syst. 2019;163:944\u201354. https:\/\/doi.org\/10.1016\/j.knosys.2018.10.020.","journal-title":"Knowl Based Syst"},{"key":"1342_CR3","doi-asserted-by":"publisher","unstructured":"Chen S, Fan J, Li G, Feng J, Tan K, Tang J. Online topic-aware influence maximization. In: Proceedings of the VLDB endowment, ACM, vol. 8, no. 6, pp. 666\u2013677, 2015. DOI:https:\/\/doi.org\/10.14778\/2735703.2735706.","DOI":"10.14778\/2735703.2735706"},{"key":"1342_CR4","doi-asserted-by":"publisher","unstructured":"Chen W, Wang Y, Yang S. Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD, KDD\u201909, pp. 199\u2013208. ACM, New York, NY. https:\/\/doi.org\/10.1145\/1557019.1557047.","DOI":"10.1145\/1557019.1557047"},{"key":"1342_CR5","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. DDSE: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl. 2018;103:119\u201330. https:\/\/doi.org\/10.1016\/j.jnca.2017.12.003.","journal-title":"J Netw Comput Appl"},{"key":"1342_CR6","doi-asserted-by":"publisher","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, ACM, 2011, https:\/\/doi.org\/10.1145\/1963192.1963217.","DOI":"10.1145\/1963192.1963217"},{"key":"1342_CR7","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin CE, Faloutsos C, VanBriesen J, Glance NS. Cost-effective outbreak detection in networks. In: KDD '07, Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, p 420\u2013429, August 2007. https:\/\/doi.org\/10.1145\/1281192.","DOI":"10.1145\/1281192"},{"key":"1342_CR8","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tordas E. Maximizing the spread of influence through social network. Proc ACM SIG Knowl Discov Datamin. 2003. https:\/\/doi.org\/10.1145\/956750.956769.","journal-title":"Proc ACM SIG Knowl Discov Datamin"},{"key":"1342_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11334-021-00396-5","volume":"17","author":"G Kundu","year":"2021","unstructured":"Kundu G, Choudhury S. A discrete genetic learning enabled PSO for targeted positive influence maximization in consumer review networks. Innov Syst Softw Eng. 2021;17:247\u201359. https:\/\/doi.org\/10.1007\/s11334-021-00396-5.","journal-title":"Innov Syst Softw Eng"},{"issue":"11","key":"1342_CR10","doi-asserted-by":"publisher","first-page":"e0206318","DOI":"10.1371\/journal.pone.0206318","volume":"13","author":"M-EG Rossi","year":"2018","unstructured":"Rossi M-EG, Shi B, Tziortziotis N, Malliaros FD, Giatsidis C, Vazirgiannis M. MATI: an efficient algorithm for influence maximization in social networks. PLoS\u00a0One. 2018;13(11):e0206318. https:\/\/doi.org\/10.1371\/journal.pone.0206318.","journal-title":"PLoS\u00a0One"},{"key":"1342_CR11","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.physa.2018.09.142","volume":"514","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B. C2IM: community based context-aware influence maximization in social networks. Physica A Stat Mech Appl. 2019;514:796\u2013818. https:\/\/doi.org\/10.1016\/j.physa.2018.09.142.","journal-title":"Physica A Stat Mech Appl"},{"key":"1342_CR12","doi-asserted-by":"publisher","unstructured":"Sumith N, Annappa B, Bhattacharya S. A holistic approach to influence maximization. Hybrid intelligence for social networks. Springer, 2017. https:\/\/doi.org\/10.1016\/j.asoc.2017.12.025","DOI":"10.1016\/j.asoc.2017.12.025"},{"key":"1342_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.future.2018.07.015","volume":"89","author":"N Sumith","year":"2018","unstructured":"Sumith N, Annappa B, Bhattacharya S. Influence maximization in large social networks: heuristics, models and parameters. Future Gener Comput Syst. 2018;89:777\u201390. https:\/\/doi.org\/10.1016\/j.future.2018.07.015.","journal-title":"Future Gener Comput Syst"},{"key":"1342_CR14","doi-asserted-by":"publisher","unstructured":"Xu X, Zhang Y, Hu Q, Xing C. A balanced method for budgeted influence maximization. In: SEKE (2015), pp. 250\u2013255, 2015. https:\/\/doi.org\/10.18293\/SEKE2015-157.","DOI":"10.18293\/SEKE2015-157"},{"key":"1342_CR15","doi-asserted-by":"publisher","unstructured":"Guoliang Li, Shuo Chen, Jianhua Feng, Kian-lee Tan, and Wen-syan Li, (2014), \u201cEfficient location-aware influence maximization\u201d, Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD '14). ACM, NY, USA, pp. 87\u201398. 2014, DOI:https:\/\/doi.org\/10.1145\/2588555.2588561","DOI":"10.1145\/2588555.2588561"},{"issue":"15","key":"1342_CR16","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.eswa.2018.05.001","volume":"108","author":"A Zareie","year":"2018","unstructured":"Zareie A, Sheikhahmadi A, Khamforoosh K. Influence maximization in social networks based on TOPSIS. Expert Syst Appl. 2018;108(15):96\u2013107. https:\/\/doi.org\/10.1016\/j.eswa.2018.05.001.","journal-title":"Expert Syst Appl"},{"key":"1342_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ins.2020.01.040","volume":"519","author":"L Li","year":"2020","unstructured":"Li L, Liu Y, Zhou Q, Yang W, Yuan J. Targeted influence maximization under a multifactor-based information propagation model. Inf Sci. 2020;519:124\u201340. https:\/\/doi.org\/10.1016\/j.ins.2020.01.040.","journal-title":"Inf Sci"},{"key":"1342_CR18","doi-asserted-by":"publisher","unstructured":"Jiuxin C, Tao Z, Dan D, Shuai X, Ziqing Z, Ma Z, Bo L. Attribute-based influence maximization in social networks. In: Web information systems engineering\u2014WISE 2016, vol. 10041, pp. 3\u201318, 2016. https:\/\/doi.org\/10.1007\/978-3-319-48740-3_1.","DOI":"10.1007\/978-3-319-48740-3_1"},{"key":"1342_CR19","doi-asserted-by":"publisher","unstructured":"Chanda J, Kanjilal A, Sengupta S, Bhattacharya S. Traceability of requirements and consistency verification of UML use case, activity and class diagram: a formal approach. In: Proceedings of international conference on methods and models in computer science (ICM2CS), pp. 1\u20134, 2009. https:\/\/doi.org\/10.1109\/ICM2CS.2009.5397941.","DOI":"10.1109\/ICM2CS.2009.5397941"},{"key":"1342_CR20","doi-asserted-by":"publisher","unstructured":"Sengupta S, Kanjilal A, Bhattacharya S (2008) Requirement traceability in software development process: an empirical approach. In: 2008 The 19th IEEE\/IFIP international symposium on rapid system prototyping, pp. 105\u2013111, 2008. https:\/\/doi.org\/10.1109\/RSP.2008.14.","DOI":"10.1109\/RSP.2008.14"},{"key":"1342_CR21","doi-asserted-by":"publisher","unstructured":"Kanjilal A, Sengupta S, Bhattacharya S. Analysis of complexity of requirements: a metrics based approach. In: Proceedings of the 2nd India software engineering conference (ISEC'09), pp. 131\u2013132, 2009, https:\/\/doi.org\/10.1145\/1506216. 1506243.","DOI":"10.1145\/1506216"},{"key":"1342_CR22","doi-asserted-by":"publisher","unstructured":"Domingos P, Richardson M. Mining the network value of customers. In: Proceedings of the seventh ACM international conference on knowledge discovery and data mining (SIGKDD), pp. 57\u201366, 2001, https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"key":"1342_CR23","unstructured":"Social circles: Facebook. https:\/\/snap.stanford.edu\/data\/ego-Facebook.html. Accessed 15 May 2021."},{"key":"1342_CR24","unstructured":"High Energy Physics\u2014theory collaboration network, https:\/\/snap.stanford.edu\/data\/ca-HepTh.html. Accessed 15 May 2021."},{"key":"1342_CR25","unstructured":"High Energy Physics Theory\u2014NetHept dataset. http:\/\/www.cs.cornell.edu\/projects\/kddcup\/datasets.html. Accessed 10 May 2021."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01342-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T21:55:54Z","timestamp":1668030954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01342-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,16]]},"references-count":25,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["1342"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01342-3","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,16]]},"assertion":[{"value":"23 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"444"}}