{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T22:59:34Z","timestamp":1711061974073},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T00:00:00Z","timestamp":1703203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,12,22]]},"abstract":"Abstract<\/jats:title>\n The community-based influence maximization in social networks refers to the strategy of amplifying the influence by leveraging the underlying connectivity patterns of the online communities. This promotes the widespread dissemination of user-generated content across socially connected entities. In our work, we have combined the simplicity of degree centrality and the bridging strength of betweenness for maximizing the influence performance. We have used community detection for partitioning the whole network into smaller subnetworks for intelligent distribution of seed nodes among these communities for improving the rate of information spreading. The proposed ranking, named as Community Diversified Seed Selection, is compared with degree centrality and betweenness centrality-based ranking in terms of rate of spreading, absolute execution time and algorithmic time complexity. The comparative study was performed on LFR\u03bc= 0.01, LFR\u03bc= 0.02 and LFR\u03bc= 0.03 benchmark networks, and validated using Facebook real-world social network. Our proposed algorithm has better and faster spreading with reasonable time complexity, therefore, making it a suitable choice for larger networks.<\/jats:p>","DOI":"10.1093\/comnet\/cnae008","type":"journal-article","created":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T07:28:25Z","timestamp":1705562905000},"source":"Crossref","is-referenced-by-count":1,"title":["Influence maximization in social networks using community-diversified seed selection"],"prefix":"10.1093","volume":"12","author":[{"given":"Himansu Sekhar","family":"Pattanayak","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, National Institute of Technology , Kurukshetra, 136119, Haryana, India"}]},{"given":"Bhawna","family":"Saxena","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering & Information Technology, Jaypee Institute of Information & Technology , Sector 62, Noida 62 , 201309, Uttar Pradesh, India"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9870-7383","authenticated-orcid":false,"given":"Adwitiya","family":"Sinha","sequence":"additional","affiliation":[{"name":"Department of Natural & Applied Sciences, TERI School of Advanced Studies , Delhi, India"}]}],"member":"286","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"2024022010450412700_cnae008-B1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.neucom.2023.02.059","article-title":"Determination of influential nodes based on the Communities\u2019 structure to maximize influence in social networks","volume":"534","author":"Kazemzadeh","year":"2023","journal-title":"Neurocomputing"},{"key":"2024022010450412700_cnae008-B2","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","article-title":"Influence maximization on social graphs: a survey","volume":"30","author":"Li","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng"},{"key":"2024022010450412700_cnae008-B3","first-page":"300","article-title":"Studying the effect of community structure for seed selection in an influence model","volume":"11","author":"Xavier","year":"2019","journal-title":"Int. J. Inf. Decision Sci"},{"key":"2024022010450412700_cnae008-B4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/978-1-5225-5097-6.ch001","volume-title":"Social Network Analytics for Contemptorary Business Organizations","author":"Jain","year":"2018"},{"key":"2024022010450412700_cnae008-B5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/03081079.2023.2194642","article-title":"TriBeC: identifying influential users on social networks with upstream and downstream network centrality","volume":"52","author":"Jain","year":"2023","journal-title":"Int. J. Gen. Syst"},{"key":"2024022010450412700_cnae008-B6","doi-asserted-by":"crossref","first-page":"112513","DOI":"10.1016\/j.chaos.2022.112513","article-title":"Identifying influential nodes in social networks: centripetal centrality and seed exclusion approach","volume":"162","author":"Wang","year":"2022","journal-title":"Chaos Solitons Fractals"},{"key":"2024022010450412700_cnae008-B7","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/s13278-019-0586-6","article-title":"A node activity and connectivity-based model for influence maximization in social networks","volume":"9","author":"Saxena","year":"2019","journal-title":"Soc. Netw. Anal. Min"},{"key":"2024022010450412700_cnae008-B8","first-page":"2218","article-title":"Hurst exponent based approach for influence maximization in social networks","volume":"34","author":"Saxena","year":"2022","journal-title":"J. King Saud Univ. Comput. Inf. Sci"},{"key":"2024022010450412700_cnae008-B9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ins.2020.03.060","article-title":"Efficient algorithms based on centrality measures for identification of top-K influential users in social networks","volume":"527","author":"Alshahrani","year":"2020","journal-title":"Inf. Sci"},{"key":"2024022010450412700_cnae008-B10","first-page":"256","author":"Adineh","year":"2018"},{"key":"2024022010450412700_cnae008-B11","first-page":"52","author":"Alshahrani","year":"2018"},{"key":"2024022010450412700_cnae008-B12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s12046-019-1189-7","article-title":"Influence maximization in online social network using different centrality measures as seed node of information propagation","volume":"44","author":"Dey","year":"2019","journal-title":"Sadhana"},{"key":"2024022010450412700_cnae008-B13","doi-asserted-by":"crossref","first-page":"124229","DOI":"10.1016\/j.physa.2020.124229","article-title":"Identifying influential spreaders in complex networks based on improved k-shell method","volume":"554","author":"Wang","year":"2020","journal-title":"Phys. A"},{"key":"2024022010450412700_cnae008-B14","doi-asserted-by":"crossref","first-page":"112859","DOI":"10.1016\/j.eswa.2019.112859","article-title":"Weighted kshell degree neighborhood: a new method for identifying the influential spreaders from a variety of complex network connectivity structures","volume":"139","author":"Namtirtha","year":"2020","journal-title":"Expert Syst. Appl"},{"issue":"1","key":"2024022010450412700_cnae008-B15","first-page":"7","article-title":"Identifying influential spreaders by gravity model","volume":"9","author":"Li","year":"2019","journal-title":"Sci. Rep"},{"key":"2024022010450412700_cnae008-B16","doi-asserted-by":"crossref","first-page":"105464","DOI":"10.1016\/j.knosys.2019.105464","article-title":"GMM: a generalized mechanics model for identifying the importance of nodes in complex networks","volume":"193","author":"Liu","year":"2020","journal-title":"Knowl. Based Syst"},{"key":"2024022010450412700_cnae008-B17","doi-asserted-by":"crossref","first-page":"110456","DOI":"10.1016\/j.chaos.2020.110456","article-title":"A generalized gravity model for influential spreaders identification in complex networks","volume":"143","author":"Li","year":"2021","journal-title":"Chaos Solitons Fractals"},{"key":"2024022010450412700_cnae008-B18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.dcan.2020.04.011","article-title":"Identifying influential nodes in social networks via community structure and influence distribution difference","volume":"7","author":"Zhang","year":"2021","journal-title":"Digit. Commun. Netw"},{"key":"2024022010450412700_cnae008-B19","doi-asserted-by":"crossref","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","article-title":"Community-diversified influence maximization in social networks","volume":"92","author":"Li","year":"2020","journal-title":"Inf. Syst"},{"key":"2024022010450412700_cnae008-B20","doi-asserted-by":"crossref","first-page":"7647","DOI":"10.1007\/s10489-021-02266-w","article-title":"IM-ELPR: influence maximization in social networks using label propagation-based community structure","volume":"51","author":"Kumar","year":"2021","journal-title":"Appl. Intell"},{"key":"2024022010450412700_cnae008-B21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2532549","article-title":"CIM: community-based influence maximization in social networks","volume":"5","author":"Chen","year":"2014","journal-title":"ACM Trans. Intell. Syst. Technol"},{"key":"2024022010450412700_cnae008-B22","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s41109-022-00477-9","article-title":"Map equation centrality: community-aware centrality based on the map equation","volume":"7","author":"Bl\u00f6cker","year":"2022","journal-title":"Appl. Netw. Sci"},{"key":"2024022010450412700_cnae008-B23","doi-asserted-by":"crossref","first-page":"10088","DOI":"10.1038\/s41598-021-89549-x","article-title":"Characterizing the interactions between classical and community-aware centrality measures in complex networks","volume":"11","author":"Rajeh","year":"2021","journal-title":"Sci. Rep"},{"key":"2024022010450412700_cnae008-B24","doi-asserted-by":"crossref","first-page":"22630","DOI":"10.1038\/s41598-022-27145-3","article-title":"Identifying vital nodes for influence maximization in attributed networks","volume":"12","author":"Wang","year":"2022","journal-title":"Sci. Rep"},{"key":"2024022010450412700_cnae008-B25","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.future.2021.01.025","article-title":"Influence maximization in social graphs based on community structure and node coverage gain","volume":"118","author":"Wang","year":"2021","journal-title":"Future Gener. Comput. Syst"},{"key":"2024022010450412700_cnae008-B26","doi-asserted-by":"crossref","first-page":"47240","DOI":"10.1109\/ACCESS.2018.2866981","article-title":"Identifying influential individuals on large-scale social networks: a community based approach","volume":"6","author":"Ye","year":"2018","journal-title":"IEEE Access"},{"key":"2024022010450412700_cnae008-B27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw"},{"key":"2024022010450412700_cnae008-B28","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1086\/229694","article-title":"Theoretical foundations for centrality measures","volume":"96","author":"Friedkin","year":"1991","journal-title":"Am. J. Sociol"},{"key":"2024022010450412700_cnae008-B29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong","year":"2001","journal-title":"Nature"},{"key":"2024022010450412700_cnae008-B30","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","article-title":"A graph-theoretic perspective on centrality","volume":"28","author":"Borgatti","year":"2006","journal-title":"Soc. Netw"},{"key":"2024022010450412700_cnae008-B31","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1039\/b905264j","article-title":"Prediction of conditional gene essentiality through graph theoretical analysis of genome-wide functional linkages","volume":"5","author":"Manimaran","year":"2009","journal-title":"Mol. BioSyst"},{"key":"2024022010450412700_cnae008-B32","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.jtrangeo.2010.08.012","article-title":"Exploring the network structure and nodal centrality of China\u2019s air transport network: a complex network approach","volume":"19","author":"Wang","year":"2011","journal-title":"J. Transp. Geogr"},{"key":"2024022010450412700_cnae008-B33","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1007\/978-3-540-74913-4_89","volume-title":"Advances in Artificial Life: 9th European Conference","author":"Gog","year":"2007"},{"key":"2024022010450412700_cnae008-B34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.swevo.2018.11.006","article-title":"Community detection in social networks based on fire propagation","volume":"44","author":"Pattanayak","year":"2019","journal-title":"Swarm Evol. Comput"},{"key":"2024022010450412700_cnae008-B35","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2024022010450412700_cnae008-B36","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","article-title":"Computing communities in large networks using random walks","volume":"10","author":"Pons","year":"2006","journal-title":"J. Graph Algorithms Appl"},{"key":"2024022010450412700_cnae008-B37","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci"},{"key":"2024022010450412700_cnae008-B38","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E"},{"key":"2024022010450412700_cnae008-B39","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S2196888823300016","article-title":"The computational complexity of hierarchical clustering algorithms for community detection: a review","volume":"10","author":"Bui","year":"2023","journal-title":"Vietnam J. Comput. Sci"},{"key":"2024022010450412700_cnae008-B40","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2024022010450412700_cnae008-B41","doi-asserted-by":"crossref","first-page":"P12002","DOI":"10.1088\/1742-5468\/2013\/12\/P12002","article-title":"Spreading dynamics in complex networks","volume":"2013","author":"Pei","year":"2013","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"2024022010450412700_cnae008-B42","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","article-title":"A faster algorithm for betweenness centrality","volume":"25","author":"Brandes","year":"2001","journal-title":"J. Math. Sociol"},{"key":"2024022010450412700_cnae008-B43","first-page":"137","author":"Kempe","year":"2003"},{"key":"2024022010450412700_cnae008-B44","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","article-title":"Community detection algorithms: a comparative analysis","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/1\/cnae008\/56713764\/cnae008.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/1\/cnae008\/56713764\/cnae008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T05:45:53Z","timestamp":1708407953000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnae008\/7611024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,22]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12,22]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnae008","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,2,1]]},"published":{"date-parts":[[2023,12,22]]}}}