The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Reexamining the cluster hypothesis: scatter/gather on retrieval results
Open accessAbstract
We present Scatter/Gather, a cluster-based document browsing method, as an alternative to ranked titles for the organization and viewing of retrieval results.We systematically evaluate Scatter/Gather in this context and find significant improvements over similarity search ranking alone.This result provides evidence validating the cluster hypothesis which states that relevant documents tend to be more similar to each other than to non-relevant documents.We describe a system employing Scatter/Gather and demonstrate that users are able to use this system close to its full potential.1
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
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
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
Self-citationRecent 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
The use of hierarchic clustering in information retrieval
Jardine, N., & van Rijsbergen, C. J. (1971) · Information Processing & Management · doi:10.1016/0020-0271(71)90051-9 · Cited by 603
TileBars: visualization of term distribution information in full text information access
Hearst, M. A. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223912 · Cited by 555
Self-citationConstant interaction-time scatter/gather browsing of very large document collections
Cutting, D. R., Karger, D. R., & Pedersen, J. O. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160706 · Cited by 207
Self-citationScatter/gather browsing communicates the topic structure of a very large text collection
Pirolli, P., Schank, P., Hearst, M., & Diehl, C. (1996) · Proceedings of the SIGCHI conference on Human factors in computing systems common ground - CHI '96 · doi:10.1145/238386.238489 · Cited by 194
Self-citationA model of cluster searching based on classification
Croft, W. B. (1980) · Information Systems · doi:10.1016/0306-4379(80)90010-1 · Cited by 144
Validation of the repertory grid for use in modeling knowledge
Latta, G. F., & Swigger, K. (1992) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199203)43:2<130::aid-asi3>3.0.co;2-s · Cited by 56
Cited by
Exploratory search: from finding to understanding
Marchionini, G. (2006) · Communications of the ACM · doi:10.1145/1121949.1121979 · Cited by 1,506
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
Web document clustering: a feasibility demonstration
Zamir, O., & Etzioni, O. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290956 · Cited by 1,055
Why Johnny Can’t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts
Zamfirescu-Pereira, J. D., Wong, R. Y., Hartmann, B., & Yang, Q. (2023) · Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3544548.3581388 · Cited by 1,274
Fast and effective text mining using linear-time document clustering
Larsen, B., & Aone, C. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312186 · Cited by 857
Metadata
- Authors
- Hearst, M. A., & Pedersen, J. O.
- Venue
- Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 76-84
- OpenAlex
- W2074449313
- Cited by
- 822
- References
- 9
- FWCI
- 28.98
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.