{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T20:36:44Z","timestamp":1717706204252},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T00:00:00Z","timestamp":1471392000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00779-016-0943-7","type":"journal-article","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T03:40:53Z","timestamp":1471405253000},"page":"717-730","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Retrieving the maximal time-bounded positive influence set from social networks"],"prefix":"10.1007","volume":"20","author":[{"given":"Tuo","family":"Shi","sequence":"first","affiliation":[]},{"given":"Siyao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,17]]},"reference":[{"key":"943_CR1","unstructured":"http:\/\/www.tns-opinion.com\/sites\/default\/files\/THINK%209.pdf"},{"key":"943_CR2","unstructured":"Suvnet-trace data. http:\/\/wirelesslab.sjtu.edu.cn"},{"key":"943_CR3","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process[J]. arXiv:1204.3074"},{"key":"943_CR4","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, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"2","key":"943_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/TST.2016.7442498","volume":"21","author":"W Dai","year":"2016","unstructured":"Dai W, Wang Y, Jin Q, Ma J (2016) An integrated incentive framework for mobile crowdsourced sensing. Tsinghua Sci Technol 21(2):146\u2013156","journal-title":"Tsinghua Sci Technol"},{"issue":"3","key":"943_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"T Dinh","year":"2014","unstructured":"Dinh T, Shen Y, Nguyen D, Thai M (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27(3):487\u2013503","journal-title":"J Comb Optim"},{"issue":"3","key":"943_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"943_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S1793830909000105","volume":"1","author":"X Gao","year":"2009","unstructured":"Gao X, Wang Y, Li X, Wu W (2009) Analysis on theoretical bonds for approximating dominating set problems. Discrete Math Algorithms Appl 1(1):71\u201384","journal-title":"Discrete Math Algorithms Appl"},{"key":"943_CR9","doi-asserted-by":"crossref","unstructured":"He Z, Cai Z, Han Q, Tong W, Sun L, Li Y (2016) An energy efficient privacy-preserving content sharing scheme in mobile social networks. Pers Ubiquitous Comput","DOI":"10.1007\/s00779-016-0952-6"},{"key":"943_CR10","doi-asserted-by":"crossref","unstructured":"He Z, Cai Z, Wang X (2015) Modeling propagation dynamics and developing optimized countermeasures for rumor spreading in online social networks. In: The 35th IEEE international conference on distributed computing systems, pp 205\u2013214","DOI":"10.1109\/ICDCS.2015.29"},{"key":"943_CR11","unstructured":"He Z, Cai Z, Yu J, et al. Cost-efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks[J]."},{"issue":"1","key":"943_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1037\/0012-1649.41.1.135","volume":"41","author":"J Jaccard","year":"2005","unstructured":"Jaccard J, Blanton H, Dodge T (2005) Peer influences on risk behavior: analysis of the effects of a close friend. Dev Psychol 41(1):135\u2013147","journal-title":"Dev Psychol"},{"key":"943_CR13","unstructured":"Jung K, Heo W, Chen W (2011) Irie: a scalable influence maximization algorithm for independent cascade model and its extensions. arXiv preprint arXiv:1111.4795"},{"key":"943_CR14","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: SIGKDD, pp 461\u2013467","DOI":"10.1145\/956750.956769"},{"key":"943_CR15","doi-asserted-by":"crossref","unstructured":"Kim D, Li D, Asgari O, Li Y, Tokuta AO (2013) A dominating set based approach to identify effective leader group of social network. In: COCOON, pp 841\u2013848","DOI":"10.1007\/978-3-642-38768-5_77"},{"key":"943_CR16","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Principles and practice of knowledge discovery in databases, pp 259\u2013271","DOI":"10.1007\/11871637_27"},{"key":"943_CR17","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, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"943_CR18","unstructured":"Leskovec J, Sosi\u010d R (2014) SNAP: a general purpose network analysis and graph mining library in C++. http:\/\/snap.stanford.edu\/snap"},{"key":"943_CR19","doi-asserted-by":"crossref","unstructured":"Liu X, Li S, Liao X, Wang L, Wu Q (2012) In-time estimation for influence maximization in large-scale social networks. In: Proceedings of the fifth workshop on social network systems, pp 1\u20136","DOI":"10.1145\/2181176.2181179"},{"key":"943_CR20","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD conference on knowledge discovery and data mining, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"943_CR21","unstructured":"Sheldon D, Dilkina B, Elmachtoub A, Finseth R et al (2012) Maximizing the spread of cascades using network design. arXiv preprint arXiv:1203.3514"},{"issue":"3","key":"943_CR22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"Wang F, Du H, Camacho E, Xu K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412(3):265\u2013269","journal-title":"Theor Comput Sci"},{"key":"943_CR23","unstructured":"Wang X, Lin Y, Zhang S, et al (2015) A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters[J]. Enterp Inf Syst, pp 1\u201330."},{"key":"943_CR24","unstructured":"Wang Y, Cai Z, Yin G, et al (2015) A trust measurement in social networks based on game theory[C]\/\/International Conference on Computational Social Networks. Springer International Publishing, pp 236\u2013247"},{"key":"943_CR25","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.comnet.2016.03.016","volume":"102","author":"Y Wang","year":"2016","unstructured":"Wang Y, Cai Z, Yin G, Gao Y, Tong X, Wu G (2016) A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Comput Netw 102:157\u2013171","journal-title":"Comput Netw"},{"key":"943_CR26","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, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"key":"943_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.jnca.2015.04.007","volume":"55","author":"Y Wang","year":"2015","unstructured":"Wang Y, Yin G, Cai Z, Dong Y, Dong H (2015) A trust-based probabilistic recommendation model for social networks. J Netw Comput Appl 55:59\u201367","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"943_CR28","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1109\/TNSM.2016.2559448","volume":"13","author":"L Zhang","year":"2016","unstructured":"Zhang L, Cai Z, Wang X (2016) Fakemask: a novel privacy preserving approach for smartphones. IEEE Trans Netw Serv Manag 13(2):335\u2013348","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"943_CR29","doi-asserted-by":"crossref","unstructured":"Zhang L, Wang X, Lu J, et al (2014) A novel contact prediction\u2010based routing scheme for DTNs[J]. Transactions on Emerging Telecommunications Technologies. Trans Emerg Telecommun Technol","DOI":"10.1002\/ett.2889"},{"issue":"1","key":"943_CR30","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s13278-011-0033-9","volume":"2","author":"W Zhang","year":"2011","unstructured":"Zhang W, Wu W, Wang F, Xu K (2011) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2(1):31\u201337","journal-title":"Soc Netw Anal Min"}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-016-0943-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00779-016-0943-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-016-0943-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:50:50Z","timestamp":1498323050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00779-016-0943-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,17]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["943"],"URL":"https:\/\/doi.org\/10.1007\/s00779-016-0943-7","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"value":"1617-4909","type":"print"},{"value":"1617-4917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,17]]}}}