{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:06:08Z","timestamp":1761599168238,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2019,6,1]]},"DOI":"10.1109\/tbdata.2018.2824826","type":"journal-article","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T18:09:53Z","timestamp":1523383793000},"page":"223-237","source":"Crossref","is-referenced-by-count":13,"title":["SIMiner: A Stigmergy-Based Model for Mining Influential Nodes in Dynamic Social Networks"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9215-4979","authenticated-orcid":false,"given":"Weihua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"ref38","article-title":"Introducing the enron corpus","author":"klimt","year":"2004","journal-title":"Proc 1st Conf Email and Anti-Spam"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2339198"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568700"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"article-title":"SNAP Datasets: Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref37"},{"key":"ref36","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume":"2012","author":"mcauley","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref35","first-page":"1655","article-title":"A note on the parameter of evaporation in the ant colony optimization algorithm","volume":"6","author":"kumar","year":"2011","journal-title":"Int Math Forum"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568692"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2014.2298873"},{"key":"ref12","first-page":"750","article-title":"Stigmergy-based influence maximization","author":"li","year":"2016","journal-title":"Proc Pacific Rim Int Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2504350"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394793"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60657-4"},{"key":"ref17","first-page":"791","article-title":"DRIMUX: Dynamic rumor influence minimization with user experience in social networks","author":"wang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2620141"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2016.7590438"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogsys.2012.06.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-3615(03)00123-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_30"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6515-8_13"},{"key":"ref5","first-page":"188","article-title":"Local algorithms for finding interesting individuals in large networks","author":"brautbar","year":"2010","journal-title":"Proc Innovat Theor Comput Sci"},{"journal-title":"The Nature of Code","year":"2012","author":"shiffman","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2014.08.013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00042-X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2676810"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2563397"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.03.050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2817946.2817965"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994525"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2824253"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.145"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2012.121"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"ref25","first-page":"1583","article-title":"Traveling salesman problem","volume":"3","author":"wang","year":"2003","journal-title":"Proc Int Conf Machine Learning and Cybernetics"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/8726180\/08334570.pdf?arnumber=8334570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:55:28Z","timestamp":1657745728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8334570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,1]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2018.2824826","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"type":"electronic","value":"2332-7790"},{"type":"electronic","value":"2372-2096"}],"subject":[],"published":{"date-parts":[[2019,6,1]]}}}