Initializing \(K\)-means batch clustering: A critical evaluation of several techniques

From MaRDI portal
Publication:2475999

DOI10.1007/s00357-007-0003-0zbMath1144.62331OpenAlexW2002586964MaRDI QIDQ2475999

Douglas Steinley, Michael J. Brusco

Publication date: 11 March 2008

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-007-0003-0



Related Items

Versatile hyper-elliptic clustering approach for streaming data based on one-pass-thrown-away learning, On the added value of bootstrap analysis for \(K\)-means clustering, Additive biclustering: a comparison of one new and two existing ALS algorithms, Piecewise regression mixture for simultaneous functional data clustering and optimal segmentation, Interpretable clustering using unsupervised binary trees, On strategies to fix degenerate \(k\)-means solutions, The effect of model misspecification on growth mixture model class enumeration, New heuristic for harmonic means clustering, A class of fuzzy clusterwise regression models, Initialization of Hidden Markov and Semi‐Markov Models: A Critical Evaluation of Several Strategies, Band depth based initialization of K-means for functional data clustering, Applying the Gradient Projection Method to a Model of Proportional Membership for Fuzzy Cluster Analysis, Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data, Unnamed Item, MCS: A method for finding the number of clusters, Initializing \(k\)-means clustering by bootstrap and data depth, Using projection-based clustering to find distance- and density-based clusters in high-dimensional data, Cophenetic-based fuzzy clustering of time series by linear dependency, An efficient \(K\)-means clustering algorithm for tall data, A simple method for screening variables before clustering microarray data, Fuzzy clustering of time series in the frequency domain, Optimal landmark point selection using clustering for manifold modeling and data classification, Multiclass classification based on multi-criteria decision-making, Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal, Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison, Affinity propagation and uncapacitated facility location problems, A membership probability-based undersampling algorithm for imbalanced data, Consumer segmentation based on use patterns, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, A general framework for efficient clustering of large datasets based on activity detection, Clusterwise p* models for social network analysis, On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling, A new chaotic whale optimization algorithm for features selection, Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses, Clustering large datasets by merging \(K\)-means solutions, Improving a centroid-based clustering by using suitable centroids from another clustering, An ensemble feature ranking algorithm for clustering analysis, Symmetry in data mining and analysis: a unifying view based on hierarchy, A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties, Thinking Ultrametrically, Thinking p-Adically, Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads, Lowdimensional additive overlapping clustering