A randomized algorithm for estimating the number of clusters
From MaRDI portal
Recommendations
- Estimating the number of clusters in a data set via the gap statistic
- Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
- Estimating the number of clusters
- An algorithm of fuzzy clastering
- A method of predicting the number of clusters using Rand's statistic
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- A randomized stochastic approximation algorithm for self-learning
- A statistical model of cluster stability
- Finding Groups in Data
- Finding the Number of Clusters in a Dataset
- Identifying genuine clusters in a classification
- On a minimal spanning tree approach in the cluster validation problem
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
- Resampling method for unsupervised estimation of cluster validity
- Stability-Based Validation of Clustering Solutions
- Statistical theory in clustering
- The Monte Carlo Method
- The Scenario Approach to Robust Control Design
- Well-Separated Clusters and Optimal Fuzzy Partitions
Cited in
(12)- An algorithm for deciding the number of clusters and validation using simulated data with application to exploring crop population structure
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- Estimating the number of clusters in a ranking data context
- Two-size probability-changing cluster algorithm
- Optimization of the cluster-variant method of constructing a multi-position direction finding system for conditions of a priori uncertainty
- Estimating the number of clusters in a data set via the gap statistic
- Generation of random clusters with specified degree of separation
- Length of clustering algorithms based on random walks with an application to neuroscience
- Experiments with, and on, algorithms for maximum likelihood clustering
- Minimum adjusted Rand index for two clusterings of a given size
- Estimating the clustering coefficient using sample complexity analysis
- A method of predicting the number of clusters using Rand's statistic
This page was built for publication: A randomized algorithm for estimating the number of clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766055)
