An improved preconditioned unsupervised K-means clustering algorithm
From MaRDI portal
An improved preconditioned unsupervised \(K\)-means clustering algorithm
Cites work
- 10.1162/153244303321897735
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- A robust EM clustering algorithm for Gaussian mixture models
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Estimating the dimension of a model
- Estimating the number of clusters in a data set via the gap statistic
- Fuzzy clustering algorithms based on resolution and their application in image compression
- Fuzzy clustering of mixed data
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Iterative shrinking method for clustering problems
- Measuring the component overlapping in the Gaussian mixture model
- Outcome-guided sparse K-means for disease subtype discovery via integrating phenotypic data with high-dimensional transcriptomic data
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- The spherical k-means++ algorithm via local search scheme
This page was built for publication: An improved preconditioned unsupervised \(K\)-means clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896100)