乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:07:56Z","timestamp":1725822476325},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319195476"},{"type":"electronic","value":"9783319195483"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19548-3_18","type":"book-chapter","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T23:30:56Z","timestamp":1432683056000},"page":"220-231","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Community Based Information Dissemination"],"prefix":"10.1007","author":[{"given":"Zhengwei","family":"Yang","sequence":"first","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Yanyan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Silu","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Ho Fung","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,28]]},"reference":[{"key":"18_CR1","unstructured":"http:\/\/knoect.uni-koblenz.de\/networks"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelilo, M.: The maximum clique problem. Handbook of Combinatorial Optimization A, pp. 1\u201374 (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: 16th SIGKDD, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: 15th SIGKDD, pp. 199\u2013208. ACM (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"11","key":"18_CR6","first-page":"41","volume":"47","author":"M Coscia","year":"1997","unstructured":"Coscia, M., Giannoti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. Journal of Statistical Analysis and Data Mining 47(11), 41\u201345 (1997)","journal-title":"Journal of Statistical Analysis and Data Mining"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: 7th SIGKDD (2001)","DOI":"10.1145\/502512.502525"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM (1999)","DOI":"10.1145\/316188.316229"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physical Reports 486, 75\u2013174 (2010)","journal-title":"Physical Reports"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., f. Bonchi, Lakshmanan, L.: A data-based approach to social influence maximization. In: VLDB (2011)","DOI":"10.14778\/2047485.2047492"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Ninth SIGKDD, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Transactions on the Web 1(1), 1\u201339 (2007)","journal-title":"ACM Transactions on the Web"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: 17th SIGKDD, pp. 529\u2013537. ACM (2011)","DOI":"10.1145\/2020408.2020492"},{"issue":"11","key":"18_CR14","first-page":"41","volume":"47","author":"J Michael","year":"1997","unstructured":"Michael, J.: Labor dispute reconciliation in a forest products manufacturing facility. Forest Products Journal 47(11), 41\u201345 (1997)","journal-title":"Forest Products Journal"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Mathematical Programming 14, 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511806452","volume-title":"Exploratory Social Network Analysis with Pajek","author":"W de Nooy","year":"2005","unstructured":"de Nooy, W., Mrvar, A., Batagelj, V.: Exploratory Social Network Analysis with Pajek. Cambridge University Press, Cambridge, UK (2005)"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., Boginski, V.: On the maximum quasi-clique problem. Discrete Applied Mathematics 161(1), 244\u2013257 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10732-010-9131-5","volume":"17","author":"W Pullan","year":"2011","unstructured":"Pullan, W., Franco, M., Mauro, B.: Cooperating local search for the maximum clique problem. J. Heuristics 17, 181\u2013199 (2011)","journal-title":"J. Heuristics"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research 25, 159\u2013185 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Raghavan, U., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76 (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD (2002)","DOI":"10.1145\/775047.775057"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: 16th SIGKDD, pp. 939\u2013948. ACM (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Yang, Z., Fu, A., Xu, Y., Huang, S., Leung, H.: Community based information dissemination. Technical Report, CSE, CUHK (2015). http:\/\/www.cse.cuhk.edu.hk\/~adafu\/paper\/cbid.pdf","DOI":"10.1007\/978-3-319-19548-3_18"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19548-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T20:53:54Z","timestamp":1676926434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19548-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319195476","9783319195483"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19548-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}