The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Web document clustering: a feasibility demonstration
Abstract
Users of Web search engines are often forced to sift through the long ordered list of document returned by the engines. The IR community has explored document clustering as an alternative method of organizing retrieval results, but clustering has yet to be deployed on the major search engines. The paper articulates the unique requirements of Web document clustering and reports on the first evaluation of clustering methods in this domain. A key requirement is that the methods create their clusters based on the short snippets returned by Web search engines. Surprisingly, we find that clusters based on snippets are almost as good as clusters created using the full text of Web documents. To satisfy the stringent requirements of the Web domain, we introduce an incremental, linear time (in the document collection size) algorithm called Suffix Tree Clustering (STC). which creates clusters based on phrases shared between documents. We show that STC is faster than standard clustering methods in this domain, and argue that Web document clustering via STC is both feasible and potentially beneficial.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
Scatter/Gather: a cluster-based approach to browsing large document collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133214 · Cited by 953
Reexamining the cluster hypothesis: scatter/gather on retrieval results
Hearst, M. A., & Pedersen, J. O. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243216 · Cited by 822
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
Automatic Query expansion using SMART : TREC 3
Buckley, C., Salton, G., Allan, J., & Singhal, A. (1994) · Cited by 464
A theory of term importance in automatic text analysis
Salton, G., Yang, C. S., & Yu, C. T. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260106 · Cited by 389
RASMUSSEN, E. M. (1992) · Information Retrieval · Cited by 323
Cited by
Automatically characterizing large scale program behavior
Sherwood, T., Perelman, E., Hamerly, G., & Calder, B. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605403 · Cited by 1,674
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Social big data: recent achievements and new challenges
Bello-Orgaz, G., Jung, J. J., & Camacho, D. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.08.005 · Cited by 846
“Text mining techniques can be applied for automatic organization, navigation, retrieval, and summary of huge volumes of text documents [59–61].”
MethodSinthanayothin, C., Boyce, J. F., Cook, H. L., & Williamson, T. H. (1999) · British Journal of Ophthalmology · doi:10.1136/bjo.83.8.902 · Cited by 778
Agglomerative clustering of a search engine query log
Beeferman, D., & Berger, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347176 · Cited by 768
Grouper: a dynamic clustering interface to Web search results
Zamir, O., & Etzioni, O. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00054-7 · Cited by 720
Self-citationThe nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
Blei, D. M., Griffiths, T. L., & Jordan, M. I. (2010) · Journal of the ACM · doi:10.1145/1667053.1667056 · Cited by 646
Data mining in soft computing framework: a survey
Mitra, S., Pal, S. K., & Mitra, P. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.977258 · Cited by 617
Why so many clustering algorithms: a position paper
Estivill-Castro, V. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568575 · Cited by 600
Learning to cluster web search results
Zeng, H.-J., He, Q.-C., Chen, Z., Ma, W.-Y., & Ma, J. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009030 · Cited by 587
A Survey of Text Clustering Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_4 · Cited by 581
Information retrieval on the web
Kobayashi, M., & Takeda, K. (2000) · ACM Computing Surveys · doi:10.1145/358923.358934 · Cited by 562
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
A survey of Web clustering engines
Carpineto, C., Osiński, S., Romano, G., & Weiss, D. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541884 · Cited by 399
Low-complexity fuzzy relational clustering algorithms for Web mining
Krishnapuram, R., Joshi, A., Nasraoui, O., & Yi, L. (2001) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.940971 · Cited by 392
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
Dhillon, I. S., & Modha, D. S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46502-2_13 · Cited by 386
Web mining in soft computing framework: relevance, state of the art and future directions
Pal, S. K., Talwar, V., & Mitra, P. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1031947 · Cited by 348
Learning approaches for detecting and tracking news events
Yang, Y., Carbonell, J. G., Brown, R. D., Pierce, T., Archibald, B. T., & Liu, X. (1999) · IEEE Intelligent Systems · doi:10.1109/5254.784083 · Cited by 339
Efficient phrase-based document indexing for Web document clustering
Hammouda, K. M., & Kamel, M. S. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.58 · Cited by 316
Using Large Language Models to Generate, Validate, and Apply User Intent Taxonomies
Shah, C., White, R., Andersen, R., Buscher, G., Counts, S., Das, S., Montazer, A., Manivannan, S., Neville, J., Rangan, N., et al. (2025) · ACM Transactions on the Web · doi:10.1145/3732294 · Cited by 33
Using Large Language Models to Generate, Validate, and Apply User Intent Taxonomies
Shah, C., White, R. W., Andersen, R., Buscher, G., Counts, S., Das, S. S. S., Montazer, A., Manivannan, S., Neville, J., Ni, X., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.13063 · Cited by 33
Clustering of search results using temporal attributes
Alonso, O., & Gertz, M. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148273 · Cited by 17
Self-Tuned Descriptive Document Clustering Using a Predictive Network
Brockmeier, A. J., Mu, T., Ananiadou, S., & Goulermas, J. Y. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2781721 · Cited by 15
Hybrid entity clustering using crowds and data
Lee, J., Cho, H., Park, J.-W., Cha, Y.-R., Hwang, S.-W., Nie, Z., & Wen, J.-R. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0328-8 · Cited by 15
How fresh do you want your search results?
Cheng, S., Arvanitis, A., & Hristidis, V. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505696 · Cited by 11
Metadata
- Authors
- Zamir, O., & Etzioni, O.
- Venue
- Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 1998-08
- Pages
- 46-54
- OpenAlex
- W2100958137
- Cited by
- 1,055
- References
- 16
- FWCI
- 19.06
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.