{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:07:33Z","timestamp":1773191253169,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"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":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s12652-020-01760-2","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T20:15:47Z","timestamp":1581452147000},"page":"4889-4908","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Hamid Ahmadi","family":"Beni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4808-2856","authenticated-orcid":false,"given":"Asgarali","family":"Bouyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,11]]},"reference":[{"key":"1760_CR1","doi-asserted-by":"publisher","first-page":"11932","DOI":"10.1038\/s41598-018-30310-2","volume":"8","author":"S Ahajjam","year":"2018","unstructured":"Ahajjam S, Badir H (2018) Identification of influential spreaders in complex networks using HybridRank algorithm. Sci Rep 8:11932","journal-title":"Sci Rep"},{"key":"1760_CR2","doi-asserted-by":"crossref","unstructured":"Atif Y, Al-Falahi K, Wangchuk T, Lindstr\u00f6m B (2019) A fuzzy logic approach to influence maximization in social networks. J Ambient Intell Humaniz Comput 1\u201317","DOI":"10.1007\/s12652-019-01286-2"},{"key":"1760_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019a) ComBIM: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"1760_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019b) Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J Ambient Intell Humaniz Comput 1\u201317","DOI":"10.1145\/3297001.3297051"},{"key":"1760_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"1760_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s11424-018-7270-1","volume":"32","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A (2019) A link-based similarity for improving community detection based on label propagation algorithm. J Syst Sci Complex 32:737\u2013758. https:\/\/doi.org\/10.1007\/s11424-018-7270-1","journal-title":"J Syst Sci Complex"},{"key":"1760_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chaos.2018.03.014","volume":"110","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks Chaos. Solitons Fractals 110:41\u201354","journal-title":"Solitons Fractals"},{"key":"1760_CR8","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"101","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101:1711\u20131733","journal-title":"Computing"},{"key":"1760_CR9","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. SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"1760_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl-Based Syst 134:149\u2013158","journal-title":"Knowl-Based Syst"},{"key":"1760_CR11","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. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1760_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2532549","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen Y-C, Zhu W-Y, Peng W-C, Lee W-C, Lee S-Y (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5:25","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1760_CR13","doi-asserted-by":"crossref","unstructured":"Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 795\u2013804","DOI":"10.1145\/2939672.2939745"},{"key":"1760_CR14","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":"1760_CR15","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":"1760_CR16","doi-asserted-by":"crossref","unstructured":"Gmati H, Mouakher A, Gonzalez-Pardo A, Camacho D (2018) A new algorithm for communities detection in social networks with node attributes. J Ambient Intell Humaniz Comput 1\u201313","DOI":"10.1007\/s12652-018-1108-5"},{"key":"1760_CR17","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011a) Celf\u2009++: 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":"1760_CR18","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV Simpath (2011b) An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining. IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1760_CR19","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:065103","journal-title":"Phys Rev E"},{"key":"1760_CR20","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1177\/0165551515621005","volume":"43","author":"M Hosseini-Pozveh","year":"2017","unstructured":"Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR (2017) A community-based approach to identify the most influential nodes in social networks. J Inf Sci 43:204\u2013220","journal-title":"J Inf Sci"},{"key":"1760_CR21","doi-asserted-by":"crossref","unstructured":"Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell, pp 1\u201314","DOI":"10.1007\/s10489-018-1387-8"},{"key":"1760_CR22","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. IEEE, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1760_CR23","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":"1760_CR24","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888","journal-title":"Nat Phys"},{"key":"1760_CR25","doi-asserted-by":"publisher","first-page":"8665","DOI":"10.1038\/srep08665","volume":"5","author":"G Lawyer","year":"2015","unstructured":"Lawyer G (2015) Understanding the influence of all nodes in a network. Sci Rep 5:8665","journal-title":"Sci Rep"},{"key":"1760_CR26","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems. pp 539\u2013547"},{"key":"1760_CR27","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. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1760_CR28","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.chaos.2017.11.029","volume":"106","author":"X Li","year":"2018","unstructured":"Li X, Guo J, Gao C, Zhang L, Zhang Z (2018) A hybrid strategy for network immunization. Chaos, Solitons Fractals 106:214\u2013219","journal-title":"Chaos, Solitons Fractals"},{"key":"1760_CR29","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. IEEE, pp 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"key":"1760_CR30","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":"1760_CR31","doi-asserted-by":"publisher","first-page":"1550037","DOI":"10.1142\/S1793830915500378","volume":"7","author":"H Ma","year":"2015","unstructured":"Ma H, Zhu Y, Li D, Kim D, Liang J (2015) Improving the influence under IC-N model in social networks. Discrete Math Algorithms Appl 7:1550037","journal-title":"Discrete Math Algorithms Appl"},{"key":"1760_CR32","doi-asserted-by":"publisher","first-page":"30062","DOI":"10.1038\/srep30062","volume":"6","author":"F Morone","year":"2016","unstructured":"Morone F, Min B, Bo L, Mari R, Makse HA (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Rep 6:30062","journal-title":"Sci Rep"},{"key":"1760_CR33","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 Humaniz Comput 8:819\u2013826","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1760_CR34","doi-asserted-by":"publisher","first-page":"62511","DOI":"10.1109\/ACCESS.2019.2912628","volume":"7","author":"L Qiu","year":"2019","unstructured":"Qiu L, Jia W, Yu J, Fan X, Gao W (2019) PHG: a three-phase algorithm for influence maximization based on community structure. IEEE Access 7:62511\u201362522","journal-title":"IEEE Access"},{"key":"1760_CR35","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 (2018) MATI: an efficient algorithm for influence maximization in social networks. PLoS ONE 13:e0206318","journal-title":"PLoS ONE"},{"key":"1760_CR36","doi-asserted-by":"publisher","first-page":"218702","DOI":"10.1103\/PhysRevLett.115.218702","volume":"115","author":"Z Ruan","year":"2015","unstructured":"Ruan Z, Iniguez G, Karsai M, Kert\u00e9sz J (2015) Kinetics of social contagion. Phys Rev Lett 115:218702","journal-title":"Phys Rev Lett"},{"key":"1760_CR37","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1007\/s00607-018-0659-9","volume":"101","author":"N Samadi","year":"2019","unstructured":"Samadi N, Bouyer A (2019) Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks. Computing 101:1147\u20131175","journal-title":"Computing"},{"key":"1760_CR38","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":"1760_CR39","doi-asserted-by":"publisher","first-page":"4833","DOI":"10.1007\/s11042-016-3266-9","volume":"75","author":"X-G Wang","year":"2016","unstructured":"Wang X-G (2016) A new algorithm for the influence maximization problem in dynamic networks or traffic sensor networks. Multimedia Tools Appl 75:4833\u20134844","journal-title":"Multimedia Tools Appl"},{"key":"1760_CR40","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":"1760_CR41","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 Knowl Disc 25:545\u2013576","journal-title":"Data Min Knowl Disc"},{"key":"1760_CR42","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.physa.2015.10.020","volume":"444","author":"Q Wang","year":"2016","unstructured":"Wang Q, Jin Y, Lin Z, Cheng S, Yang T (2016) Influence maximization in social networks under an independent cascade-based model. Phys A 444:20\u201334","journal-title":"Phys A"},{"key":"1760_CR43","doi-asserted-by":"publisher","first-page":"92070","DOI":"10.1109\/ACCESS.2019.2927775","volume":"7","author":"Y Xin","year":"2019","unstructured":"Xin Y, Gao C, Wang Z, Zhen X, Li X (2019) Discerning influential spreaders in complex networks by accounting the spreading heterogeneity of the nodes. IEEE Access 7:92070\u201392078","journal-title":"IEEE Access"},{"key":"1760_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42:181\u2013213","journal-title":"Knowl Inf Syst"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-01760-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-020-01760-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-01760-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T07:27:15Z","timestamp":1612942035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-020-01760-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":44,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1760"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-01760-2","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,11]]},"assertion":[{"value":"25 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}