{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:50:15Z","timestamp":1764784215836},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:00:00Z","timestamp":1559260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:00:00Z","timestamp":1559260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13638-019-1405-5","type":"journal-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T14:03:04Z","timestamp":1559311384000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Context-based influence maximization with privacy protection in social networks"],"prefix":"10.1186","volume":"2019","author":[{"given":"Dong","family":"Jing","sequence":"first","affiliation":[]},{"given":"Ting","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"key":"1405_CR1","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1145\/1835804.1835934","volume-title":"Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201910","author":"W. Chen","year":"2010","unstructured":"W. Chen, C. Wang, Y. Wang, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201910. Scalable influence maximization for prevalent viral marketing in large-scale social networks (ACMNew York, 2010), pp. 1029\u20131038."},{"key":"1405_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201903","author":"D. Kempe","year":"2003","unstructured":"D. Kempe, J. Kleinberg, E. Tardos, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201903. Maximizing the spread of influence through a social network (ACMNew York, 2003), pp. 137\u2013146."},{"key":"1405_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/1557019.1557047","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201909","author":"W. Chen","year":"2009","unstructured":"W. Chen, Y. Wang, S. Yang, in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201909. Efficient influence maximization in social networks (ACMNew York, 2009), pp. 199\u2013208."},{"key":"1405_CR4","first-page":"199","volume-title":"Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM \u201910","author":"L. Liu","year":"2010","unstructured":"L. Liu, J. Tang, J. Han, M. Jiang, S. Yang, in Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM \u201910. Mining topic-level influence in heterogeneous networks (ACMNew York, 2010), pp. 199\u2013208."},{"key":"1405_CR5","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1145\/1557019.1557108","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201909","author":"J. Tang","year":"2009","unstructured":"J. Tang, J. Sun, C. Wang, Z. Yang, in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201909. Social influence analysis in large-scale networks (ACMNew York, 2009), pp. 807\u2013816."},{"issue":"4","key":"1405_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1145\/76894.76895","volume":"21","author":"N. R. Adam","year":"1989","unstructured":"N. R. Adam, J. C. Worthmann, Security-control methods for statistical databases: a comparative study. ACM Comput. Surv.21(4), 515\u2013556 (1989).","journal-title":"ACM Comput. Surv."},{"key":"1405_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/342009.335438","volume-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201900","author":"R. Agrawal","year":"2000","unstructured":"R. Agrawal, R. Srikant, in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201900. Privacy-preserving data mining (ACMNew York, 2000), pp. 439\u2013450."},{"issue":"5","key":"1405_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"L. Sweeney, K-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst.10(5), 557\u2013570 (2002).","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"1405_CR9","first-page":"1","volume-title":"Proceedings of the 33rd International Conference on Automata, Languages and Programming - Volume Part II, ICALP\u201906","author":"C. Dwork","year":"2006","unstructured":"C. Dwork, in Proceedings of the 33rd International Conference on Automata, Languages and Programming - Volume Part II, ICALP\u201906. Differential privacy (SpringerBerlin, Heidelberg, 2006), pp. 1\u201312."},{"key":"1405_CR10","volume-title":"An analysis of approximations for maximizing submodular set functions\u2014II","year":"1978","unstructured":"M. L. Fisher, G. L. Nemhauser, L. A. Wolsey, An analysis of approximations for maximizing submodular set functions\u2014II. (M. L. Balinski, A. J. Hoffman, eds.) (Springer, Berlin, Heidelberg, 1978)."},{"key":"1405_CR11","volume-title":"Proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA\u201917","author":"D. Du","year":"2017","unstructured":"D. Du, in Proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA\u201917. Maximization of multi-factor influence (SpringerBerlin, 2017)."},{"key":"1405_CR12","first-page":"3111","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2, NIPS\u201913","author":"T. Mikolov","year":"2013","unstructured":"T. Mikolov, I. Sutskever, K. Chen, G. Corrado, J. Dean, in Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2, NIPS\u201913. Distributed representations of words and phrases and their compositionality (Curran Associates Inc.USA, 2013), pp. 3111\u20133119."},{"key":"1405_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/775047.775126","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902","author":"G. Jeh","year":"2002","unstructured":"G. Jeh, J. Widom, in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902. Simrank: A measure of structural-context similarity (ACMNew York, 2002), pp. 538\u2013543. \n                    https:\/\/doi.org\/10.1145\/775047.775126\n                    \n                  ."},{"key":"1405_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/502512.502525","volume-title":"Proceedings of the Seventh ACM SIGKDD International conference on Knowledge Discovery and Data Mining, KDD \u201901","author":"P. Domingos","year":"2001","unstructured":"P. Domingos, M. Richardson, in Proceedings of the Seventh ACM SIGKDD International conference on Knowledge Discovery and Data Mining, KDD \u201901. Mining the network value of customers (ACMNew York, 2001), pp. 57\u201366."},{"key":"1405_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/775047.775057","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902","author":"M. Richardson","year":"2002","unstructured":"M. Richardson, P. Domingos, in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201902. Mining knowledge-sharing sites for viral marketing (ACMNew York, 2002), pp. 61\u201370."},{"key":"1405_CR16","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/1281192.1281239","volume-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201907","author":"J. Leskovec","year":"2007","unstructured":"J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201907. Cost-effective outbreak detection in networks (ACMNew York, 2007), pp. 420\u2013429."},{"key":"1405_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/1963192.1963217","volume-title":"Proceedings of the 20th International Conference Companion on World Wide Web, WWW \u201911","author":"A. Goyal","year":"2011","unstructured":"A. Goyal, W. Lu, L. V. S. Lakshmanan, in Proceedings of the 20th International Conference Companion on World Wide Web, WWW \u201911. Celf++: Optimizing the greedy algorithm for influence maximization in social networks (ACMNew York, 2011), pp. 47\u201348."},{"issue":"3","key":"1405_CR18","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10115-012-0540-7","volume":"33","author":"Y. -C. Chen","year":"2012","unstructured":"Y. -C. Chen, W. -C. Peng, S. -Y. Lee, Efficient algorithms for influence maximization in social networks. Knowl. Inf. Syst.33(3), 577\u2013601 (2012).","journal-title":"Knowl. Inf. Syst."},{"key":"1405_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/ICDM.2011.132","volume-title":"Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM \u201911","author":"A. Goyal","year":"2011","unstructured":"A. Goyal, W. Lu, L. V. S. Lakshmanan, in Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM \u201911. Simpath: An efficient algorithm for influence maximization under the linear threshold model (IEEE Computer SocietyWashington, 2011), pp. 211\u2013220."},{"key":"1405_CR20","first-page":"127","volume-title":"Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI\u201911","author":"Q. Jiang","year":"2011","unstructured":"Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si, K. Xie, in Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI\u201911. Simulated annealing based influence maximization in social networks (AAAI PressPalo Alto, 2011), pp. 127\u2013132."},{"key":"1405_CR21","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/11893004_120","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems: 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006. Proceedings, Part II","author":"M. Kimura","year":"2006","unstructured":"M. Kimura, K. Saito, in Knowledge-Based Intelligent Information and Engineering Systems: 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006. Proceedings, Part II, ed. by B. Gabrys, R. J. Howlett, and L. C. Jain. Approximate Solutions for the Influence Maximization Problem in a Social Network (SpringerBerlin, Heidelberg, 2006), pp. 937\u2013944."},{"issue":"C","key":"1405_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jnca.2016.01.004","volume":"63","author":"M. Han","year":"2016","unstructured":"M. Han, M. Yan, Z. Cai, Y. Li, An exploration of broader influence maximization in timeliness networks with opportunistic selection. J. Netw. Comput. Appl.63(C), 39\u201349 (2016). \n                    https:\/\/doi.org\/10.1016\/j.jnca.2016.01.004\n                    \n                  .","journal-title":"J. Netw. Comput. Appl."},{"issue":"5","key":"1405_CR23","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00779-016-0943-7","volume":"20","author":"T. Shi","year":"2016","unstructured":"T. Shi, S. Cheng, Z. Cai, Y. Li, J. Li, Retrieving the maximal time-bounded positive influence set from social networks. Pers. Ubiquit. Comput.20(5), 717\u2013730 (2016). \n                    https:\/\/doi.org\/10.1007\/s00779-016-0943-7\n                    \n                  .","journal-title":"Pers. Ubiquit. Comput."},{"key":"1405_CR24","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/ICDE.2013.6544831","volume-title":"Data Engineering (ICDE), 2013 IEEE 29th International Conference On","author":"J. Kim","year":"2013","unstructured":"J. Kim, S. K. Kim, H. Yu, in Data Engineering (ICDE), 2013 IEEE 29th International Conference On. Scalable and parallelizable processing of influence maximization for large-scale social networks? (IEEE Computer SocietyWashington, DC, 2013), pp. 266\u2013277."},{"key":"1405_CR25","first-page":"1","volume-title":"Computer Communications, IEEE INFOCOM 2016-The 35th Annual IEEE International Conference On","author":"J. L. Z. Cai","year":"2016","unstructured":"J. L. Z. Cai, M. Yan, Y. Li, in Computer Communications, IEEE INFOCOM 2016-The 35th Annual IEEE International Conference On. Using crowdsourced data in location-based social networks to explore influence maximization (IEEEWashington, DC, 2016), pp. 1\u20139."},{"issue":"4","key":"1405_CR26","first-page":"1","volume":"28","author":"M. Han","year":"2016","unstructured":"M. Han, M. Yan, Z. Cai, Y. Li, X. Cai, J. Yu, Influence maximization by probing partial communities in dynamic online social networks. Trans. Emerg. Telecommun. Technol.28(4), 1\u201315 (2016).","journal-title":"Trans. Emerg. Telecommun. Technol."},{"issue":"3","key":"1405_CR27","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1109\/TKDE.2016.2621038","volume":"29","author":"L. Guo","year":"2017","unstructured":"L. Guo, D. Zhang, G. Cong, W. Wu, K. -L. Tan, Influence maximization in trajectory databases. IEEE Trans. Knowl. Data Eng.29(3), 627\u2013641 (2017). \n                    https:\/\/doi.org\/10.1109\/TKDE.2016.2621038\n                    \n                  .","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1405_CR28","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X. Li","year":"2018","unstructured":"X. Li, X. Cheng, S. Su, C. Sun, Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing.275:, 1601\u20131613 (2018). \n                    https:\/\/doi.org\/10.1016\/j.neucom.2017.10.007\n                    \n                  .","journal-title":"Neurocomputing."},{"key":"1405_CR29","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-02922-7_18","volume-title":"Web Information Systems Engineering \u2013 WISE 2018","author":"X. Xiong","year":"2018","unstructured":"X. Xiong, R. Li, Y. Li, X. Gu, T. Liang, in Web Information Systems Engineering \u2013 WISE 2018, ed. by H. Hacid, W. Cellary, H. Wang, H. -Y. Paik, and R. Zhou. Topical authority-sensitive influence maximization (SpringerCham, 2018), pp. 262\u2013277."},{"key":"1405_CR30","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/3162957.3162997","volume-title":"Proceedings of the 3rd International Conference on Communication and Information Processing, ICCIP \u201917","author":"B. Manaskasemsak","year":"2017","unstructured":"B. Manaskasemsak, R. Phuangpanya, A. Rungsawang, in Proceedings of the 3rd International Conference on Communication and Information Processing, ICCIP \u201917. Topic-constrained influence maximization in social networks (ACMNew York, 2017), pp. 405\u2013410. \n                    https:\/\/doi.org\/10.1145\/3162957.3162997\n                    \n                  ."},{"issue":"99","key":"1405_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2016.2613521","volume":"PP","author":"Z. Cai","year":"2016","unstructured":"Z. Cai, Z. He, X. Guan, Y. Li, Collective data-sanitization for preventing sensitive information inference attacks in social networks. IEEE Trans. Dependable Secure Comput.PP(99), 1\u20131 (2016).","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"1405_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TST.2016.7399279","volume":"21","author":"W. Han","year":"2016","unstructured":"W. Han, X. Zhu, Z. Zhu, W. Chen, W. Zheng, J. Lu, A comparative analysis on weibo and twitter. Tsinghua Sci. Technol.21(1), 1\u201316 (2016). \n                    https:\/\/doi.org\/10.1109\/TST.2016.7399279\n                    \n                  .","journal-title":"Tsinghua Sci. Technol."},{"issue":"4","key":"1405_CR33","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TST.2016.7536715","volume":"21","author":"R. Bi","year":"2016","unstructured":"R. Bi, Y. Li, X. Zheng, An optimal content caching framework for utility maximization. Tsinghua Sci. Technol.21(4), 374\u2013384 (2016). \n                    https:\/\/doi.org\/10.1109\/TST.2016.7536715\n                    \n                  .","journal-title":"Tsinghua Sci. Technol."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1405-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-019-1405-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1405-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T23:19:09Z","timestamp":1590794349000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-019-1405-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,31]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1405"],"URL":"https:\/\/doi.org\/10.1186\/s13638-019-1405-5","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,31]]},"assertion":[{"value":"21 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"142"}}