{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:52Z","timestamp":1725562672962},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145889"},{"type":"electronic","value":"9783642145896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14589-6_32","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T10:38:13Z","timestamp":1281955093000},"page":"316-326","source":"Crossref","is-referenced-by-count":3,"title":["C&C: An Effective Algorithm for Extracting Web Community Cores"],"prefix":"10.1007","author":[{"given":"Xianchao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yueting","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wenxin","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1126\/science.287.5461.2115a","volume":"287","author":"L.A. Adamic","year":"2000","unstructured":"Adamic, L.A., Huberman, B.A.: Pawer-Law Distribution of the World Wide Web. Science\u00a0287, 2115 (2000)","journal-title":"Science"},{"key":"32_CR2","first-page":"487","volume-title":"proceedings of 20th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikanth, R.: Fast algorithms for mining association rules. In: proceedings of 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann, San Fransisco (1994)"},{"key":"32_CR3","first-page":"595","volume-title":"Proceedings of the Thirteenth International World Wide Web Conference","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The Web Graph Framework: Compression Techniques. In: Proceedings of the Thirteenth International World Wide Web Conference, pp. 595\u2013601. ACM, New York (2004)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, A., Gareth, O., Jeffrey, S., Tsaparas, P.: Finding authorities and hubs from link structures on the World Wide Web. In: Proceedings of the 10th international conference on World Wide Web, pp. 415\u2013429. ACM, New York (2001)","DOI":"10.1145\/371920.372096"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/1242572.1242635","volume-title":"16th international conference on World Wide Web","author":"Y. Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: 16th international conference on World Wide Web, pp. 461\u2013470. ACM, New York (2007)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/347090.347121","volume-title":"Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"G.W. Flake","year":"2000","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of Web communities. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 150\u2013160. ACM, New York (2000)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"G.W. Flake","year":"2002","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Self-Organization and Identification of Web Communities. Computer\u00a035, 66\u201371 (2002)","journal-title":"Computer"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/276627.276652","volume-title":"Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space","author":"D. Gibson","year":"1998","unstructured":"Gibson, D., Kleinberg, J.M., Raghavan, P.: Inferring Web communities from link topology. In: Proceedings of the ninth ACM conference on Hypertext and hypermedia: links, objects, time and space, pp. 225\u2013234. ACM, New York (1998)"},{"key":"32_CR9","first-page":"721","volume-title":"31st international conference on Very large data bases","author":"D. Gibson","year":"2005","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: 31st international conference on Very large data bases, pp. 721\u2013732. ACM, New York (2005)"},{"key":"32_CR10","first-page":"165","volume-title":"Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms","author":"J.X. Hao","year":"1992","unstructured":"Hao, J.X., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 165\u2013174. SIAM, Philadelphia (1992)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM\u00a046, 604\u2013632 (1999)","journal-title":"Journal of the ACM"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks\u00a031, 11\u201316 (1999)","journal-title":"Computer Networks"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Park, H.W., Thelwall, M.: Hyperlink Analyses of the World Wide Web: A Review. Journal of Computer Mediated Communication\u00a08(4) (2003)","DOI":"10.1111\/j.1083-6101.2003.tb00223.x"},{"key":"32_CR14","first-page":"7","volume":"101","author":"P.K. Reddy","year":"2001","unstructured":"Reddy, P.K., Kitsuregawa, M.: An Approach to Find Related Communities Based on Bipartite Graphs. Institute of Electronics, Information and Communication Engineers\u00a0101, 7\u201314 (2001)","journal-title":"Institute of Electronics, Information and Communication Engineers"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM\u00a044, 585\u2013591 (1997)","journal-title":"Journal of the ACM"},{"key":"32_CR16","unstructured":"WISDOM Lab.: \n                    \n                      http:\/\/wisdom.dlut.edu.cn\/"},{"key":"32_CR17","volume-title":"Web communities: analysis and construction","author":"Y.C. Zhang","year":"2006","unstructured":"Zhang, Y.C., Yu, J.X., Hou, J.Y.: Web communities: analysis and construction. Springer, Berlin (2006)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14589-6_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:55:07Z","timestamp":1606168507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14589-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145889","9783642145896"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14589-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}