-Means: A new generalized k-means clustering algorithm
From MaRDI portal
(Redirected from Publication:4458907)
Recommendations
Cited in
(19)- \(K\)-expectiles clustering
- Generalized k-means in GLMs with applications to the outbreak of COVID-19 in the United States
- A new clustering preserving transformation for \(k\)-means algorithm output
- An extension of the \(K\)-means algorithm to clustering skewed data
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Cluster-based sliced inverse regression
- Interpretation and optimization of the \(k\)-means algorithm.
- A comparative study of the \(K\)-means algorithm and the normal mixture model for clustering: bivariate homoscedastic case
- \(k\)-means clustering of extremes
- Analysing microarray expression data through effective clustering
- Geometry-inference based clustering heuristic: new \(k\)-means metric for Gaussian data and experimental proof of concept
- K-means cloning: adaptive spherical K-means clustering
- A Pitman measure of similarity in k-means for clustering heavy-tailed data
- Clustering via minimum volume ellipsoids
- Clustering: a neural network approach
- scientific article; zbMATH DE number 1927172 (Why is no real title available?)
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- Integrating model predictive control and deep learning for the management of an EV charging station
- A generalized k-means problem for clustering and an ADMM-based k-means algorithm
This page was built for publication: -Means: A new generalized k-means clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458907)