Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
From MaRDI portal
Publication:263223
DOI10.1007/s00357-010-9049-5zbMath1337.62127OpenAlexW2047191928MaRDI QIDQ263223
F. Blanchet-Sadri, M. Dambrine
Publication date: 4 April 2016
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-010-9049-5
Related Items
A clustering method combining multiple range tests and K-means, Cluster-based reduced-order modelling of a mixing layer, Feature weighting as a tool for unsupervised feature selection, Factor probabilistic distance clustering (FPDC): a new clustering method, Community detection in feature-rich networks using data recovery approach, Braverman’s Spectrum and Matrix Diagonalization Versus iK-Means: A Unified Framework for 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, Noise-insensitive discriminative subspace fuzzy clustering, Consensus rate-based label propagation for semi-supervised classification, A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering, Banks' business models in the euro area: a cluster analysis in high dimensions, Unsupervised modelling of a transitional boundary layer, \(K\)-means cloning: adaptive spherical \(K\)-means clustering, Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison, Estimating the Number of Clusters Using Cross-Validation, On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling, Cluster-based feedback control of turbulent post-stall separated flows, An ensemble feature ranking algorithm for clustering analysis, Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- OCLUS: an analytic method for generating clusters with known overlap
- An examination of indexes for determining the number of clusters in binary data sets
- A sequential fitting procedure for linear data analysis models
- Optimising \(k\)-means clustering results with standard software packages
- A method of predicting the number of clusters using Rand's statistic
- A toolbox for \(K\)-centroids cluster analysis
- A Monte Carlo study of thirty internal criterion measures for cluster analysis
- On the number of clusters
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- On a resampling approach for tests on the number of clusters with mixture model-based clustering of tissue samples
- Nearest neighbours in least-squares data imputation algorithms with different missing patterns
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- Mathematical classification and clustering
- Determination of cluster number in clustering microarray data
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- Finding Groups in Data
- Hierarchical grouping methods and stopping rules: an evaluation
- Probabilistic Principal Component Analysis
- Model-Based Gaussian and Non-Gaussian Clustering
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Finding the Number of Clusters in a Dataset
- Clustering Methods: A History of k-Means Algorithms
- Estimation of Dependences Based on Empirical Data
- J-MEANS: A new local search heuristic for minimum sum of squares clustering