{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:49Z","timestamp":1759637569997,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s13278-020-00653-8","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T04:02:15Z","timestamp":1591416135000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A general method of active friending in different diffusion models in social networks"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4535-2280","authenticated-orcid":false,"given":"Shuyang","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuangen","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: International workshop on web and internet economics. Springer, pp 306\u2013311","key":"653_CR1","DOI":"10.1007\/978-3-540-77105-0_31"},{"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. ACM, pp 199\u2013208","key":"653_CR2","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"crossref","unstructured":"Chen H, Xu W, Zhai X, Bi Y, Wang A, Du D-Z (2014) How could a boy influence a girl?. In: 2014 10th International conference on mobile ad-hoc and sensor networks. IEEE, pp 279\u2013287","key":"653_CR3","DOI":"10.1109\/MSN.2014.45"},{"doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 8\u201397","key":"653_CR4","DOI":"10.1109\/ICDM.2010.118"},{"issue":"3","key":"653_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti M, Cornu\u00e9jols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Appl Math 7(3):251\u2013274","journal-title":"Discrete Appl Math"},{"doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 57\u201366","key":"653_CR6","DOI":"10.1145\/502512.502525"},{"doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web. ACM, pp 47\u201348","key":"653_CR7","DOI":"10.1145\/1963192.1963217"},{"doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th international conference on data mining. IEEE, pp 211\u2013220","key":"653_CR8","DOI":"10.1109\/ICDM.2011.132"},{"unstructured":"Iyer RK, Bilmes JA (2013) Submodular optimization with submodular cover and submodular knapsack constraints. In: Advances in neural information processing systems, pp 2436\u20132444","key":"653_CR9"},{"unstructured":"Iyer RK, Jegelka S, Bilmes JA (2013) Curvature and optimal algorithms for learning and minimizing submodular functions. In: Advances in neural information processing systems, pp 2742\u20132750","key":"653_CR10"},{"doi-asserted-by":"crossref","unstructured":"Jegelka S, Bilmes J (2011) Submodularity beyond submodular energies: coupling edges in graph cuts. In: CVPR 2011. IEEE, pp 1897\u20131904","key":"653_CR11","DOI":"10.1109\/CVPR.2011.5995589"},{"doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137\u2013146","key":"653_CR12","DOI":"10.1145\/956750.956769"},{"issue":"11","key":"653_CR13","first-page":"116","volume":"10","author":"J Kwon","year":"2010","unstructured":"Kwon J, Kim S (2010) Friend recommendation method using physical and social context. Int J Comput Sci Netw Secur 10(11):116\u2013120","journal-title":"Int J Comput Sci Netw Secur"},{"issue":"2","key":"653_CR14","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10878-016-0006-z","volume":"33","author":"Z Lu","year":"2017","unstructured":"Lu Z, Zhang Z, Wu W (2017) Solution of bharathi-kempe-salek conjecture for influence maximization on arborescence. J Comb Optim 33(2):803\u2013808","journal-title":"J Comb Optim"},{"doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 61\u201370","key":"653_CR15","DOI":"10.1145\/775047.775057"},{"doi-asserted-by":"crossref","unstructured":"Silva NB, Tsang R, Cavalcanti GD, Tsang J (2010) A graph-based friend recommendation system using genetic algorithm. In: IEEE congress on evolutionary computation. IEEE, pp 1\u20137","key":"653_CR16","DOI":"10.1109\/CEC.2010.5586144"},{"issue":"1","key":"653_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343","journal-title":"Oper Res Lett"},{"doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 75\u201386","key":"653_CR18","DOI":"10.1145\/2588555.2593670"},{"unstructured":"Vondr\u00e1k J (2010) Submodularity and curvature: the optimal algorithm (combinatorial optimization and discrete algorithms)","key":"653_CR19"},{"issue":"3","key":"653_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TMC.2014.2322373","volume":"14","author":"Z Wang","year":"2015","unstructured":"Wang Z, Liao J, Cao Q, Qi H, Wang Z (2015) Friendbook: a semantic-based friend recommendation system for social networks. IEEE Trans Mob Comput 14(3):538\u2013551","journal-title":"IEEE Trans Mob Comput"},{"issue":"4","key":"653_CR21","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1007\/s10878-016-9991-1","volume":"31","author":"A Wang","year":"2016","unstructured":"Wang A, Wu W, Cui L (2016) On bharathi-kempe-salek conjecture for influence maximization on arborescence. J Comb Optim 31(4):1678\u20131684","journal-title":"J Comb Optim"},{"unstructured":"Wu W, Du D-Z, et\u00a0al. (2018) An approximation algorithm for active friending in online social networks. arXiv preprint arXiv:1811.00643","key":"653_CR22"},{"doi-asserted-by":"crossref","unstructured":"Xie X (2010) Potential friend recommendation in online social network. In: Proceedings of the 2010 IEEE\/ACM int\u2019l conference on green computing and communications & int\u2019l conference on cyber, physical and social computing. IEEE Computer Society, pp 831\u2013835","key":"653_CR23","DOI":"10.1109\/GreenCom-CPSCom.2010.28"},{"doi-asserted-by":"crossref","unstructured":"Yang D-N, Hung H-J, Lee W-C, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 713\u2013721","key":"653_CR24","DOI":"10.1145\/2487575.2487599"},{"doi-asserted-by":"crossref","unstructured":"Yuan J, Wu W, Li Y, Du D (2017) Active friending in online social networks. In: Proceedings of the Fourth IEEE\/ACM international conference on big data computing, applications and technologies. ACM, pp 139\u2013148","key":"653_CR25","DOI":"10.1145\/3148055.3148073"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00653-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-020-00653-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00653-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T23:23:49Z","timestamp":1622935429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-020-00653-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1007\/s13278-020-00653-8","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"6 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"41"}}