{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:26:06Z","timestamp":1777548366789,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Statistics & Data Analysis"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0167-9473(02)00070-1","type":"journal-article","created":{"date-parts":[[2002,11,4]],"date-time":"2002-11-04T19:41:17Z","timestamp":1036438877000},"page":"19-45","source":"Crossref","is-referenced-by-count":65,"title":["Web document clustering using hyperlink structures"],"prefix":"10.1016","volume":"41","author":[{"given":"Xiaofeng","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyuan","family":"Zha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"H.Q. Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"D. Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-9473(02)00070-1_BIB1","doi-asserted-by":"crossref","unstructured":"Anick, P.G., 1994. Adapting a full-text information retrieval system to compute the troubleshooting domain. Proceedings of ACM SIGIR \u201994, pp. 349\u2013358.","DOI":"10.1007\/978-1-4471-2099-5_36"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB2","doi-asserted-by":"crossref","unstructured":"Bharat, K., Broder, A., 1998. A technique for measuring the relative size and overlap of public web search engines. Proceedings of the Seventh World-Wide Web Conference (WWW7). pp. 379\u2013388.","DOI":"10.1016\/S0169-7552(98)00127-5"},{"issue":"1\u20137","key":"10.1016\/S0167-9473(02)00070-1_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0169-7552(98)00087-7","article-title":"Automatic resource compilation by analyzing hyperlink structure and associated text","volume":"30","author":"Chakrabarti","year":"1998","journal-title":"Comput. Networks ISDN Systems"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Dom, B.E., Gibson, D., Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A., 1999. Mining the link structure of the world wide web. 32(8):60\u201367.","DOI":"10.1109\/2.781636"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB5","series-title":"A Lower Bound for the Smallest Eigenvalue of the Laplacian, Problems in Analysis","author":"Cheeger","year":"1970"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB6","series-title":"Spectral Graph Theory","author":"Chung","year":"1997"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB7","unstructured":"Croft, W.B., Cook, R., Wilder, D. Providing government information on the internet: Experience with \u2018thomas\u2019. Technical Report, University of Massachusetts, pp. 95-45."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB8","first-page":"938","article-title":"Algorithms for partitioning of graphs and computer logic based on connected matrices","volume":"15","author":"Donath","year":"1972","journal-title":"IBM Tech. Disclosure Bull."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB9","doi-asserted-by":"crossref","unstructured":"Efthimiadis, E.N., 1993. A user-centered evaluation of ranking algorithms for interactive query expansion. Proceedings of ACM SIGIR \u201993, pp. 146\u2013159.","DOI":"10.1145\/160688.160710"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB10","series-title":"Cluster Analysis","author":"Everitt","year":"1993"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB12","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","article-title":"A property of eigenvectors of non-negative symmetric matrices and its application to graph theory","volume":"25","author":"Fiedler","year":"1975","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB13","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L., 2000. Efficient identification of web communities, SIGKDD. pp. 150\u2013160.","DOI":"10.1145\/347090.347121"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB14","unstructured":"Frieze, A., Kannan, R., Vempala, S., 2000. Fast Monte-Carlo methods for finding low-rank approximations. http:\/\/www.cs.yale.edu\/homes\/kannan\/Papers\/pubs.html."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB15","doi-asserted-by":"crossref","unstructured":"Gibson, D., Kleinberg, J., Raghavan, P., 1998. Inferring web communities from link topology. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia (HYPER-98), June 20\u201324, ACM Press, New York, pp. 225\u2013234.","DOI":"10.1145\/276627.276652"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB16","series-title":"Matrix Computations","author":"Golub","year":"1989"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB17","series-title":"Classification","author":"Gordon","year":"1981"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB18","doi-asserted-by":"crossref","unstructured":"Hearst, M.A., Paderson, J.O., 1996. Re-examining the cluster hypothesis: Scatter\/gather on retrieval results. Proceedings of the SIGIR\u201996, pp. 246\u2013255.","DOI":"10.1145\/243199.243216"},{"issue":"2","key":"10.1016\/S0167-9473(02)00070-1_BIB19","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","article-title":"An improved spectral graph partitioning algorithm for mapping parallel computations","volume":"16","author":"Hendrickson","year":"1995","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB20","unstructured":"Karypis, G., Kumar, V. Metis\u2217 a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. http:\/\/www.cs.umn.edu\/~karypis."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB21","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S., 1999. The web as a graph: measurements, models, and methods. Proceedings of the Fifth Annual International Computing and combinatorics Conference, 1999. pp. 26\u201328.","DOI":"10.1007\/3-540-48686-0_1"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB22","unstructured":"Kleinberg, J.M., 1998. Authoritative sources in a hyperlinked environment. Proceedings of Ninth ACM-SIAM Symposium on Discrete Algorithm, 25\u201327 January, pp. 668\u2013677."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB23","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A., 1999. Extracting large-scale knowledge bases from the web. Proceedings of the 25th VLDB Conference. pp. 639\u2013650."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB24","unstructured":"Larson, R.R., 1996. Bibliometrics of the world wide web: an exploratory analysis of the intellectual structures of cyberspace. Proceedings of the SIGIR\u201996, pp. 71\u201378."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB25","doi-asserted-by":"crossref","unstructured":"Li, Y., 1998. Towards a qualitative search engine. IEEE Internet Comput., 2(4):24\u201329.","DOI":"10.1109\/4236.707687"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB26","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(92)90288-Q","article-title":"Laplace eigenvalues of graphs\u2014a survey","volume":"109","author":"Mohar","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB27","doi-asserted-by":"crossref","unstructured":"Pirolli, P., Pitkow, J., Rao, R., 1996. Silk from a sow's ear: extracting usable structures from the web. Proceedings of the SIGCHI\u201996, pp. 118\u2013125.","DOI":"10.1145\/238386.238450"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB28","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","article-title":"An algorithm for suffix stripping","volume":"14","author":"Porter","year":"1980","journal-title":"Program"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB29","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","article-title":"Partitioning sparse matrices with egenvectors of graph","volume":"11","author":"Pothen","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB30","series-title":"Information Retrieval","author":"RijsBergen","year":"1979"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB31","unstructured":"Shi, J., Malik, J., 1997. Normalized cuts and image segmentation. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, June. pp. 731\u2013737."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/asi.4630240406","article-title":"Co-citation in the scientific literature: A new measure of the relationship between two documents","volume":"24","author":"Small","year":"1973","journal-title":"J. Amer. Soc. Inform. Sci."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB33","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S., 1996. Spectral partitioning works: planar graphs and finite element meshes. IEEE Symposium on Foundations of Computer Science, pp. 96\u2013105.","DOI":"10.1109\/SFCS.1996.548468"},{"key":"10.1016\/S0167-9473(02)00070-1_BIB34","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0306-4573(88)90027-1","article-title":"Recent trends in hierarchical document clustering","volume":"24","author":"Willett","year":"1988","journal-title":"Inform. Process. Manage."},{"key":"10.1016\/S0167-9473(02)00070-1_BIB35","doi-asserted-by":"crossref","unstructured":"Zamir, O., Etzioni, O., 1999. Grouper: a dynamic clustering interface to web search results, WWW8.","DOI":"10.1016\/S1389-1286(99)00054-7"}],"container-title":["Computational Statistics & Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167947302000701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167947302000701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T06:26:49Z","timestamp":1620196009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167947302000701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0167947302000701"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9473(02)00070-1","relation":{},"ISSN":["0167-9473"],"issn-type":[{"value":"0167-9473","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}