(Enter summary)
Abstract: Clustering, in data mining, is useful for discovering groups
and identifying interesting distributions in the underlying
data. Traditional clustering algorithms either favor clusters
with spherical shapes and similar sizes, or are very fragile
in the presence of outliers. We propose a new clustering
algorithm called CURE that is more robust to outliers,
and identifies clusters having non-spherical shapes and wide
variances in size. CURE achieves this by representing each
cluster by a certain... (Update)
Similar documents based on text: More All
0.6: CURE: An Efficient Clustering Algorithm for Large Databases - Guha, Rastogi, Shim (1998)
(Correct)
0.5: ROCK: A Robust Clustering Algorithm for Categorical Attributes - Guha, Rastogi, Shim (2000)
(Correct)
0.4: A Clustering Algorithm for Categorical Attributes - Guha, Rastogi, Shim (1997)
(Correct)
Related documents from co-citation: More All
63: Efficient and Effective Clustering Methods for Spatial Data Mining
- Ng, Han - 1994
61: BIRCH: An Efficient Data Clustering Method for Very Large Databases
- Zhang, Ramakrishnan et al. - 1996
49: Automatic subspace clustering of high dimensional data for data mining applicati..
- Agrawal, Gehrke et al. - 1998
BibTeX entry: (Update)
S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 73--84, New York, 1998. ACM. http://citeseer.ist.psu.edu/guha98cure.html More
@inproceedings{ guha98cure,
author = "Sudipto Guha and Rajeev Rastogi and Kyuseok Shim",
title = "{CURE}: an efficient clustering algorithm for large databases",
pages = "73--84",
year = "1998",
url = "citeseer.ist.psu.edu/guha98cure.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
837
Cambridge University Press (context) - Motwani, Raghavan - 1995
805
Algorithms for Clustering Data (context) - Jain, Dubes - 1988
666
The Design and Analysis of Spatial Data Structures (context) - Samet - 1990
666
The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
516
tree: an efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
242
Efficient and effective clustering methods for spatial data ..
- Ng, Han - 1994
233
tree: a dynamic index for multi-dimensional objects
- Sellis, Roussopoulos et al. - 1987
222
Birch: An efficient data clustering method for very large da..
- Zhang, Ramakrishnan et al. - 1996
210
A density-based algorithm for discovering clusters in large ..
- Ester, Kriegel et al. - 1996
46
A database interface for clustering in large spatial databas.. (context) - Ester, Kriegel et al. - 1995
38
Parallel algorithms for hierarchical clustering
- Olson - 1993
17
ACM Transactions on Mathematical Software (context) - Vitter, with et al. - 1985
3
CURE: A clustering algorithm for large databases (context) - Guha, Rastogi et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dblab.kaist.ac.kr/~shim/): More
Improvements on a Heuristic Algorithm for Multiple-Query.. - Shim (1994)
(Correct)
Query Optimization in the Presence of Foreign Functions - Chaudhuri, Shim (1993)
(Correct)
A Constraint-based Spatial Extension to SQL - Kuper, Ramaswamy, Shim, Su (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC