{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:48:08Z","timestamp":1725443288167},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.23919\/apnoms.2019.8892973","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T17:43:46Z","timestamp":1573667026000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Susceptible-Infection-based Cost-effective Seed Mining in Social Networks"],"prefix":"10.23919","author":[{"given":"Ashis","family":"Talukder","sequence":"first","affiliation":[]},{"given":"Choong Seon","family":"Hong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.40"},{"key":"ref11","first-page":"1533","article-title":"A susceptible-infection-based greedy model for mining cost-effective seeds in social networks","author":"talukder","year":"2019","journal-title":"Korean Computer Congress (KCC 2019)"},{"key":"ref12","first-page":"354","article-title":"An approach of cost optimized influence maximization in social networks","author":"talukder","year":"0","journal-title":"Network Operations and Management Symposium (APNOMS) 2017 19th Asia-Pacific"},{"key":"ref13","first-page":"24","article-title":"The grim: Target marketing in social network","author":"talukder","year":"0","journal-title":"The International Symposium on Perception Action and Cognitive Systems (PACS 2016)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2018.8406245"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CBD.2017.47"},{"key":"ref17","first-page":"1203","article-title":"Active reverse path based reverse influence maximization in social networks","author":"talukder","year":"2017","journal-title":"Korea Software Congress (KSC 2017)"},{"key":"ref18","first-page":"888","article-title":"Threshold estimation models for influence maximization in social network","author":"talukder","year":"2016","journal-title":"The Korea Institute of Information Scientists and Engineers"},{"key":"ref19","first-page":"1082","article-title":"A heuristic approach for viral marketing cost optimization in social networks","author":"talukder","year":"2018","journal-title":"Korea Software Congress (KSC 2018)"},{"journal-title":"Fundamentals of Computer Algorithms","year":"2012","author":"horowitz","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref27","first-page":"2128","article-title":"Knapsack-based reverse influence maximization for target marketing in social networks","author":"talukder","year":"2019","journal-title":"Proceedings of the 34th ACMIS\/GAPP Symposium on Applied Computing ser SAC ‘19"},{"key":"ref3","first-page":"1214","article-title":"Rumors in the social network: Finding the offenders using influence maximization","author":"talukder","year":"2015","journal-title":"Korean Computer Congress (KCC 2015]"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1996","author":"hochbaum","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124368"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2691544"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2758353"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"journal-title":"Practical Social Network Analysis With Python","year":"2018","author":"krishna","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN.2019.8718136"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"ref23","first-page":"1277","article-title":"Epidemiological reverse influence maximization in social networks with negative influencing","author":"talukder","year":"2018","journal-title":"Korean Computer Congress (KCC 2018)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908412"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5626\/JOK.2018.45.11.1203"}],"event":{"name":"2019 20th Asia-Pacific Network Operations and Management Symposium (APNOMS)","start":{"date-parts":[[2019,9,18]]},"location":"Matsue, Japan","end":{"date-parts":[[2019,9,20]]}},"container-title":["2019 20th Asia-Pacific Network Operations and Management Symposium (APNOMS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8886548\/8892835\/08892973.pdf?arnumber=8892973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:43:14Z","timestamp":1598229794000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8892973\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":30,"URL":"https:\/\/doi.org\/10.23919\/apnoms.2019.8892973","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}