A two-stage hierarchical clustering method that uses categorized vertices and edges in KNN connection subgraphs to improve merging decisions on low-dimensional benchmarks.
CURE: An efficient clustering algorithm for large databases.ACM Sigmod record, 27(2):73–84, 1998
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs
A two-stage hierarchical clustering method that uses categorized vertices and edges in KNN connection subgraphs to improve merging decisions on low-dimensional benchmarks.