Enhancing principal direction divisive clustering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 194758 (Why is no real title available?)
- scientific article; zbMATH DE number 847282 (Why is no real title available?)
- Algorithm AS 136: A K-Means Clustering Algorithm
- Bandwidth selection for kernel distribution function estimation
- Communality of a variable: Formulation by cluster analysis
- Concept decompositions for large sparse text data using clustering
- Cure: An efficient clustering algorithm for large databases
- Enhancing principal direction divisive clustering
- Grouping Multidimensional Data
- Introduction to clustering large and high-dimensional data.
- Linear algebra and its applications
- Pattern recognition.
- Smoothing parameter selection for smooth distribution functions
- The Fast Gauss Transform
- The linear nearest neighbour statistic
Cited in
(6)- Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- Enhanced clustering embedded in curvilinear distance analysis guided by pairwise constraints
- Distributed clustering using collective principal component analysis
- Divisive clustering of high dimensional data streams
- Enhancing principal direction divisive clustering
This page was built for publication: Enhancing principal direction divisive clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991947)