{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:21Z","timestamp":1771036341138,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540788072","type":"print"},{"value":"9783540788089","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78808-9_14","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"149-156","source":"Crossref","is-referenced-by-count":3,"title":["Web Structure Mining by Isolated Stars"],"prefix":"10.1007","author":[{"given":"Yushi","family":"Uno","sequence":"first","affiliation":[]},{"given":"Yoshinobu","family":"Ota","sequence":"additional","affiliation":[]},{"given":"Akio","family":"Uemichi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Asano, Y., Imai, H., Toyoda, M., Kitsuregawa, M.: Finding neighbor communities in the Web using inter-site graph. In: Proc. 14th Int\u2019l Conf. on Database and Expert Syst. Appl., pp. 558\u2013568 (2003)","DOI":"10.1007\/978-3-540-45227-0_55"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. Computer Networks\u00a033, 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proc. 6th ACM Int\u2019l Conf. on Knowl, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Ito, H., Iwama, K., Osumi, T.: Linear-time enumeration of isolated cliques. In: Proc. 13th Ann. European Symp. on Algorithms, pp. 119\u2013130 (2005)","DOI":"10.1007\/11561071_13"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. Kleinberg","year":"1997","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046, 604\u2013632 (1997)","journal-title":"J. ACM"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The Web as a graph: measurements, models, and methods. In: Proc. 5th Int\u2019l Comput. and Comb. Conf., pp. 1\u201317 (1999)","DOI":"10.1007\/3-540-48686-0_1"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: Trawling the Web for emerging cyber-communities. Comput. Net.\u00a031, 1481\u20131493 (1999)","journal-title":"Comput. Net."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Laura, L., Leonardi, S., Millozzi, S., Meyer, U., Sibeyn, J.F.: Algorithms and experiments for the Webgraph. In: Proc. 11th Ann. Euro. Symp. on Algor., pp. 703\u2013714 (2003)","DOI":"10.1007\/978-3-540-39658-1_63"},{"key":"14_CR9","unstructured":"Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: Proc. 19th Int\u2019l Conf. on Data Eng., pp. 405\u2013416 (2003)"},{"key":"14_CR10","unstructured":"The Stanford WebBase Project, \n                  \n                    http:\/\/www-diglib.stanford.edu\/testbed\/doc2\/WebBase\/"},{"key":"14_CR11","unstructured":"Uno, Y., Ota, Y., Uemichi, A., Umano, M.: Mining communities and detecting link farms in the Web by isolated cliques. In: Proc. 2nd Int\u2019l Conf. on Knowledge Engineering and Decision Support, pp. 179\u2013187 (2006)"},{"key":"14_CR12","unstructured":"Uno, Y., Uemichi, A.: Structural properties of i-star contracted webgraphs. Manuscript"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Wu, B., Davison, B.D.: Identifying link farm spam pages. In: Proc. 14th Int\u2019l WWW Conf., pp. 820\u2013829 (2005)","DOI":"10.1145\/1062745.1062762"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78808-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:22:55Z","timestamp":1619522575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78808-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788072","9783540788089"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78808-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}