Optimising \(k\)-means clustering results with standard software packages
From MaRDI portal
Publication:957269
DOI10.1016/j.csda.2004.06.017zbMath1429.62244OpenAlexW1983173908WikidataQ121828039 ScholiaQ121828039MaRDI QIDQ957269
David J. Hand, Wojtek Janusz Krzanowski
Publication date: 26 November 2008
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2004.06.017
Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (14)
On the added value of bootstrap analysis for \(K\)-means clustering ⋮ Additive biclustering: a comparison of one new and two existing ALS algorithms ⋮ The \(k\)-means algorithm for 3D shapes with an application to apparel design ⋮ KmL: k-means for longitudinal data ⋮ Constrained dual scaling for detecting response styles in categorical data ⋮ A unifying model for biclustering ⋮ Initializing \(k\)-means clustering by bootstrap and data depth ⋮ A parametric \(k\)-means algorithm ⋮ The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ A toolbox for \(K\)-centroids cluster analysis ⋮ Three-mode partitioning ⋮ Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm ⋮ Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
Uses Software
Cites Work
This page was built for publication: Optimising \(k\)-means clustering results with standard software packages
