Generalized density clustering
classification
🧮 math.ST
stat.TH
keywords
clustersclusteringdensitygeneralizedhighaccuratealgorithmallowed
pith:AZDSERMS Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{AZDSERMS}
Prints a linked pith:AZDSERMS badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We study generalized density-based clustering in which sharply defined clusters such as clusters on lower-dimensional manifolds are allowed. We show that accurate clustering is possible even in high dimensions. We propose two data-based methods for choosing the bandwidth and we study the stability properties of density clusters. We show that a simple graph-based algorithm successfully approximates the high density clusters.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.