Scatter/Gather
Douglass R. Cutting, David R. Karger, Jan Pedersen et al. · ACM SIGIR Forum · 2017
Document clustering has not been well received as an information retrieval tool. Objections to its use fall into two main categories: first, that clustering is too slow for large corpora (with running time often quadratic in the number of documents); and second, that clustering does not appreciably improve retrieval. We argue that these problems arise only when clustering is used in an attempt to improve conventional search techniques. However, looking at clustering as an information access tool in its own right obviates these objections, and provides a powerful new access paradigm. We present a document browsing technique that employs docum-ent clustering as its primary operation. We also present fast (linear time) clustering algorithm.
Cited by 1,419 works. doi:10.1145/3130348.3130362
Authors
References
- Introduction to Modern Information Retrieval
- Algorithms for Clustering Data
- SLINK: An optimally efficient algorithm for the single-link cluster method
- The use of hierarchic clustering in information retrieval
- Recent trends in hierarchic document clustering: A critical review
- Optimization of inverted vector searches
- Document clustering: An evaluation of some experiments with the cranfield 1400 collection
- Document clustering using an inverted file approach
- Clustering large files of documents using the single‐link method
- Using interdocument similarity information in document retrieval systems