The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Incremental clustering and dynamic information retrieval
Open accessAbstract
Motivated by applications such as document and image classification in information retrieval, we consider the problem of clustering dynamic point sets in a metric space.We propose a model-c~led incremental clustering which is based on a careful analysis of the requirements of the information retrieval application, and which should also be useful in other applications.The goal is to efficiently maintain clusters of small diameter as new points are inserted.We analyze several natural greedy algorithms and demonstrate that they perform poorly.We propose new deterministic and randomized incremental clustering algorithms which have a provably good performance.We complement our positive results with lower bounds on the performance of incremental algorithms.Finally, we consider tbe dual clustering problem where the clusters are of fixed diameter, and the goal is to minimize the number of clusters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,390
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,355
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Gordon, A. D., & Hartigan, J. A. (1976) · Journal of the American Statistical Association · doi:10.2307/2286880 · Cited by 2,569
Aldenderfer, M. S. (1984) · Cited by 2,502
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,393
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Salton, G. (1988) · Cited by 1,587
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
A Best Possible Heuristic for the k-Center Problem
Hochbaum, D. S., & Shmoys, D. B. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.2.180 · Cited by 921
Optimal packing and covering in the plane are NP-complete
Fowler, R. J., Paterson, M. S., & Tanimoto, S. L. (1981) · Information Processing Letters · doi:10.1016/0020-0190(81)90111-3 · Cited by 734
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
Bookstein, A. (1990) · Information Processing & Management · doi:10.1016/0306-4573(90)90016-u · Cited by 699
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 529
Optimal algorithms for approximate clustering
Feder, T., & Greene, D. (1988) · doi:10.1145/62212.62255 · Cited by 437
Self-citationWitten, I. H. (1994) · Cited by 428
RASMUSSEN, E. M. (1992) · Information Retrieval · Cited by 323
On the Complexity of Clustering Problems
Brucker, P. (1978) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-95322-4_5 · Cited by 266
Motwani, R., Phillips, S., & Torng, E. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90151-1 · Cited by 232
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
A survey of information retrieval and filtering methods
Faloutsos, C., & Oard, D. W. (1995) · University Libraries (University of Maryland) · Cited by 193
Incremental clustering for dynamic information processing
Can, F. (1993) · ACM Transactions on Information Systems · doi:10.1145/130226.134466 · Cited by 151
Approximation algorithms for geometric problems
Bern, M. W., & Eppstein, D. (1996) · Cited by 118
Information Retrieval: Advanced Topics and Techniques
(2024) · ACM eBooks · doi:10.1145/3674127 · Cited by 88
Cited by
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Image Retrieval: Current Techniques, Promising Directions, and Open Issues
Rui, Y., Huang, T. S., & Chang, S.-F. (1999) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.1999.0413 · Cited by 1,601
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
Self-citationOn clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000002 · Cited by 718
Metadata
- Authors
- Charikar, M., Chekuri, C., Feder, T., & Motwani, R.
- Venue
- Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 626-635
- OpenAlex
- W2080068757
- Cited by
- 354
- References
- 28
- FWCI
- 6.06
- 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.