Intelligent choice of the number of clusters in K-means clustering: an experimental study with different cluster spreads
From MaRDI portal
(Redirected from Publication:263223)
Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
Recommendations
Cites work
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 2205355 (Why is no real title available?)
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- A Monte Carlo study of thirty internal criterion measures for cluster analysis
- A method of predicting the number of clusters using Rand's statistic
- A sequential fitting procedure for linear data analysis models
- A toolbox for \(K\)-centroids cluster analysis
- An examination of indexes for determining the number of clusters in binary data sets
- Clustering Methods: A History of k-Means Algorithms
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- Determination of cluster number in clustering microarray data
- Estimating the number of clusters in a data set via the gap statistic
- Estimation of Dependences Based on Empirical Data
- Finding Groups in Data
- Finding the Number of Clusters in a Dataset
- Finite mixture models
- Hierarchical grouping methods and stopping rules: an evaluation
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Mathematical classification and clustering
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Model-Based Gaussian and Non-Gaussian Clustering
- Nearest neighbours in least-squares data imputation algorithms with different missing patterns
- OCLUS: an analytic method for generating clusters with known overlap
- On a resampling approach for tests on the number of clusters with mixture model-based clustering of tissue samples
- On the number of clusters
- Optimising \(k\)-means clustering results with standard software packages
- Probabilistic Principal Component Analysis
Cited in
(21)- Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison
- Feature weighting as a tool for unsupervised feature selection
- Noise-insensitive discriminative subspace fuzzy clustering
- Applying the gradient projection method to a model of proportional membership for fuzzy cluster analysis
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- Cluster-based feedback control of turbulent post-stall separated flows
- Unsupervised modelling of a transitional boundary layer
- Banks' business models in the euro area: a cluster analysis in high dimensions
- Cluster-based reduced-order modelling of a mixing layer
- Consensus rate-based label propagation for semi-supervised classification
- A clustering method combining multiple range tests and K-means
- An ensemble feature ranking algorithm for clustering analysis
- K-means cloning: adaptive spherical K-means clustering
- Community detection in feature-rich networks using data recovery approach
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- Estimating the Number of Clusters Using Cross-Validation
- Comparison of internal evaluation criteria in hierarchical clustering of categorical data
- Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data
- Braverman’s Spectrum and Matrix Diagonalization Versus iK-Means: A Unified Framework for Clustering
- Factor probabilistic distance clustering (FPDC): a new clustering method
- Selecting the Minkowski exponent for intelligent K-means with feature weighting
This page was built for publication: Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263223)
