{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T12:40:02Z","timestamp":1749904802313,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,13]],"date-time":"2017-01-13T00:00:00Z","timestamp":1484265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,1,13]],"date-time":"2017-01-13T00:00:00Z","timestamp":1484265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1560625"],"award-info":[{"award-number":["1560625"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s40537-016-0061-4","type":"journal-article","created":{"date-parts":[[2017,1,13]],"date-time":"2017-01-13T12:57:48Z","timestamp":1484312268000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Vaccination allocation in large dynamic networks"],"prefix":"10.1186","volume":"4","author":[{"given":"Justin","family":"Zhan","sequence":"first","affiliation":[]},{"given":"Timothy","family":"Rafalski","sequence":"additional","affiliation":[]},{"given":"Gennady","family":"Stashkevich","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Verenich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,13]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Leskovec J, Backstrom L, Kleinberg J. Meme-tracking and the dynamics of the news cycle. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201909. New York: ACM; 2009. p. 497\u2013506.","DOI":"10.1145\/1557019.1557077"},{"issue":"8","key":"61_CR2","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TKDE.2013.139","volume":"26","author":"G Li","year":"2014","unstructured":"Li G, Hoi SCH, Chang K, Liu W, Jain R. Collaborative online multitask learning. IEEE Trans Knowl Data Eng. 2014;26(8):1866\u201376.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"61_CR3","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s11036-012-0401-3","volume":"17","author":"Y Wu","year":"2012","unstructured":"Wu Y, Deng S, Huang H. Information propagation through opportunistic communication in mobile social networks. Mob Netw Appl. 2012;17(6):773\u201381.","journal-title":"Mob Netw Appl"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Nkwi WG, de\u00a0Bruijn M. \u201cHuman Telephone Lines\u201d: flag post mail relay runners in british southern cameroon (1916\u20131955) and the establishment of a modern communications network. Int Rev Soc Hist; 59:211\u201335, 12 2014. Copyright-Copyright \u00a9 Internationaal Instituut voor Sociale Geschiedenis 2014; Last updated\u20142015-07-25; SubjectsTermNotLitGenreText-Cameroon; United Kingdom\u2013UK.","DOI":"10.1017\/S0020859014000340"},{"issue":"1","key":"61_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tmaid.2011.12.003","volume":"10","author":"GM Hwang","year":"2012","unstructured":"Hwang GM, Mahoney PJ, James JH, Lin GC, Berro AD, Keybl MA, Goedecke DM, Mathieu JJ, Wilson T. A model-based tool to predict the propagation of infectious disease via airports. Travel Med Infect Dis. 2012;10(1):32\u201342.","journal-title":"Travel Med Infect Dis"},{"issue":"3","key":"61_CR6","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1007\/s11277-015-2833-0","volume":"85","author":"I Memon","year":"2015","unstructured":"Memon I. A secure and efficient communication scheme with authenticated key establishment protocol for road networks. Wirel Pers Commun. 2015;85(3):1167\u201391.","journal-title":"Wirel Pers Commun"},{"issue":"3","key":"61_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.appdev.2008.12.010","volume":"30","author":"TA Pempek","year":"2009","unstructured":"Pempek TA, Yermolayeva YA, Calvert SL. College students\u2019 social networking experiences on facebook. J Appl Dev Psychol. 2009;30(3):227\u201338.","journal-title":"J Appl Dev Psychol"},{"issue":"1","key":"61_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1687-1499-2013-1","volume":"2013","author":"F Cai","year":"2013","unstructured":"Cai F, Qingfeng H, LanSheng H, Li S, Xiao-Yang L. Virus propagation power of the dynamic network. EURASIP J Wirel Commun Netw. 2013;2013(1):1\u201314.","journal-title":"EURASIP J Wirel Commun Netw"},{"issue":"2","key":"61_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1049\/iet-its.2012.0070","volume":"8","author":"J Wang","year":"2014","unstructured":"Wang J, Liu Y, Deng K. Modelling and simulating worm propagation in static and dynamic traffic. IET Intell Transp Syst. 2014;8(2):155\u201363.","journal-title":"IET Intell Transp Syst"},{"issue":"2","key":"61_CR10","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2717511","volume":"1","author":"D Merrill","year":"2015","unstructured":"Merrill D, Garland M, Grimshaw A. High-performance and scalable gpu graph traversal. ACM Trans Parallel Comput. 2015;1(2):14:1\u201330.","journal-title":"ACM Trans Parallel Comput"},{"issue":"2","key":"61_CR11","first-page":"20:1","volume":"10","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Prakash BA. Data-aware vaccine allocation over large networks. ACM Trans Knowl Discov Data. 2015;10(2):20:1\u201332.","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"61_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s11036-005-6422-4","volume":"10","author":"R Battiti","year":"2005","unstructured":"Battiti R, Cigno RL, Sabel M, Orava F, Pehrson B. Wireless LANs: from warchalking to open access networks. Mob Netw Appl. 2005;10(3):275\u201387.","journal-title":"Mob Netw Appl"},{"issue":"5","key":"61_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0034523","volume":"7","author":"F Emmert-Streib","year":"2012","unstructured":"Emmert-Streib F, Dehmer M. Exploring statistical and population aspects of network complexity. PLoS ONE. 2012;7(5):1\u201317.","journal-title":"PLoS ONE"},{"issue":"3","key":"61_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10207-012-0160-y","volume":"11","author":"R Dewri","year":"2012","unstructured":"Dewri R, Ray I, Poolsappasit N, Whitley D. Optimal security hardening on attack tree models of networks: a cost-benefit analysis. Int J Inform Secur. 2012;11(3):167\u201388.","journal-title":"Int J Inform Secur"},{"issue":"9","key":"61_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0024043","volume":"6","author":"R Yaesoubi","year":"2011","unstructured":"Yaesoubi R, Cohen T. Dynamic health policies for controlling the spread of emerging infections: influenza as an example. PLoS ONE. 2011;6(9):1\u201311.","journal-title":"PLoS ONE"},{"key":"61_CR16","doi-asserted-by":"publisher","first-page":"247901","DOI":"10.1103\/PhysRevLett.91.247901","volume":"91","author":"R Cohen","year":"2003","unstructured":"Cohen R, Havlin S, ben Avraham D. Efficient immunization strategies for computer networks and populations. Phys Rev Lett. 2003;91:247901.","journal-title":"Phys Rev Lett"},{"key":"61_CR17","doi-asserted-by":"publisher","first-page":"05","DOI":"10.1371\/journal.pmed.0040174","volume":"4","author":"J Dushoff","year":"2007","unstructured":"Dushoff J, Plotkin JB, Viboud C, Simonsen L, Miller M, Loeb M, et al. Vaccinating to protect a vulnerable subpopulation. PLoS Med. 2007;4:05.","journal-title":"PLoS Med"},{"issue":"8","key":"61_CR18","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TKDE.2004.31","volume":"16","author":"SA Vinterbo","year":"2004","unstructured":"Vinterbo SA. Privacy: a machine learning view. IEEE Trans Knowl Data Eng. 2004;16(8):939\u201348.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"61_CR19","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0036144500371907","volume":"42","author":"HW Hethcote","year":"2000","unstructured":"Hethcote HW. The mathematics of infectious diseases. SIAM Rev. 2000;42:599.","journal-title":"SIAM Rev"},{"key":"61_CR20","unstructured":"NDSSL. Synthetic data products for societal infrastructures and protopopulations: Data set 2.0. ndssl-tr-07-003. 2007. http:\/\/ndssl.vbi.vt.edu\/Publications\/ndssl-tr-07-003.pdf ."},{"issue":"1","key":"61_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T Lengauer","year":"1979","unstructured":"Lengauer T, Tarjan RE. A fast algorithm for finding dominators in a flowgraph. ACM Trans Program Lang Syst. 1979;1(1):121\u201341.","journal-title":"ACM Trans Program Lang Syst"},{"issue":"1","key":"61_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2764913","volume":"12","author":"L Georgiadis","year":"2015","unstructured":"Georgiadis L, Tarjan RE. Dominator tree certification and divergent spanning trees. ACM Trans Algorithms. 2015;12(1):11\u201342.","journal-title":"ACM Trans Algorithms"},{"issue":"3","key":"61_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1145\/1065887.1065888","volume":"27","author":"AL Buchsbaum","year":"2005","unstructured":"Buchsbaum AL, Kaplan H, Rogers A, Westbrook JR. Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans Program Lang Syst. 2005;27(3):383\u20137.","journal-title":"ACM Trans Program Lang Syst"},{"key":"61_CR24","doi-asserted-by":"crossref","unstructured":"Aric A, Hagberg, Daniel\u00a0A. Schult, Pieter J. Swart. Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy2008). Pasadena; 2008. p. 11\u20135.","DOI":"10.25080\/TCWV9851"},{"key":"61_CR25","unstructured":"python. Time complexity. 2015. https:\/\/wiki.python.org\/moin\/TimeComplexity . Accessed 1 Aug 2016."},{"key":"61_CR26","unstructured":"NSCEE. How to run jobs with pbs\/pro on cherry-creek. 2016. http:\/\/wiki.nscee.edu . Accessed 1 Aug 2016."},{"key":"61_CR27","unstructured":"Leskovec J, Krevl A. SNAP Datasets: Stanford large network dataset collection. 2014. http:\/\/snap.stanford.edu\/data ."},{"key":"61_CR28","doi-asserted-by":"crossref","unstructured":"Chopade P, Zhan J (2016) Towards a framework for community detection in large networks using game-theoretic modeling. IEEE Trans Big Data (accepted)","DOI":"10.1109\/TBDATA.2016.2628725"},{"key":"61_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/s40537-016-0058-z","volume":"3","author":"M Pirouz","year":"2016","unstructured":"Pirouz M, Zhan J, Tayeb S (2016) An optimized approach for community detection and ranking. J Big Data 3:22","journal-title":"J Big Data"},{"key":"61_CR30","doi-asserted-by":"crossref","unstructured":"Gan W, Lin C-W, Chao H-C, Zhan J (2016) Data mining in distributed environment: a survey. WIREs Data Min Knowl Disc (accepted)","DOI":"10.1002\/widm.1216"},{"key":"61_CR31","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","volume":"116","author":"JM-T Wu","year":"2017","unstructured":"Wu JM-T, Zhan J, Lin JC-W (2017) An ACO-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102\u2013113","journal-title":"Knowl-Based Syst"},{"issue":"C","key":"61_CR32","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Yang L, Fournier-Viger F, Wu M-T, Hong T-P, Wang LS-L, Zhan J (2016) Mining high-utility itemsets based on particle swarm optimization. J Eng Appl Artif Intell 55(C):320\u2013330","journal-title":"J Eng Appl Artif Intell"},{"issue":"C","key":"61_CR33","first-page":"279","volume":"55","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Wu T-Y, Fournier-Viger P, Lin G,\u00a0Zhan\u00a0J, Voznak M (2016) Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining. J Eng Appl Artif Intell 55(C):279\u2013284","journal-title":"J Eng Appl Artif Intell"},{"key":"61_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JIFS-169138","volume":"18","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Hong T-P, Wu JM-T, Zhan\u00a0J (2016) Efficient mining of multiple fuzzy frequent itemsets. Int J Fuzzy Syst 18:1-9","journal-title":"Int J Fuzzy Syst"},{"issue":"2","key":"61_CR35","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Hong T-P,\u00a0Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"issue":"6","key":"61_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2016.03.007","volume":"53","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Liu Q, Fournier-Viger P, Hong T-P, Voznak M, Zhan J\u00a0(2016) A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. J Eng Appl Artif Intell 53(C):1\u201318","journal-title":"J Eng Appl Artif Intell"},{"key":"61_CR37","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s40537-016-0050-7","volume":"3","author":"J Zhan","year":"2016","unstructured":"Zhan J, Gudibande V, Parsa SPK (2016) Idenfication of Top-K influential communities in large networks. J Big Data 3:16","journal-title":"J Big Data"},{"key":"61_CR38","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/s40537-016-0047-2","volume":"3","author":"M Pirouz","year":"2016","unstructured":"Pirouz M, Zhan J (2016) Optimized relativity search: node reduction in personalized page rank estimation for large graphs. J Big Data 3:12","journal-title":"J Big Data"},{"key":"61_CR39","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/s40537-016-0042-7","volume":"3","author":"H Selim","year":"2016","unstructured":"Selim H, Zhan J (2016) Towards shortest path identification on large networks. J Big Data 3:10","journal-title":"J Big Data"},{"issue":"1","key":"61_CR40","first-page":"1","volume":"2","author":"P Chopade","year":"2016","unstructured":"Chopade P, Zhan J (2016) Structural and functional analytics for community detection in large-scale complex networks. J Big Data 2(1):1","journal-title":"J Big Data"},{"issue":"1","key":"61_CR41","first-page":"1","volume":"2","author":"X Fang","year":"2016","unstructured":"Fang X, Zhan J (2016) Sentiment analysis using product review data. J Big Data 2(1):1","journal-title":"J Big Data"},{"issue":"1","key":"61_CR42","first-page":"1","volume":"2","author":"J Zhan","year":"2014","unstructured":"Zhan J, Fang X (2014) A computational framework for detecting malicious actors in communities. Int J Inf Priv Secur Integr 2(1):1\u201320","journal-title":"Int J Inf Priv Secur Integr"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0061-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-016-0061-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0061-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T11:58:50Z","timestamp":1749902330000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-016-0061-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,13]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1186\/s40537-016-0061-4","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2017,1,13]]},"assertion":[{"value":"26 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}