K-modes Clustering
By A. Chaturvedi, P. Green, J. Caroll. Journal of Classification, 2001
316 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/a248d6e878954e523948c291b8120d9b894bf294
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ismail Ben Ayed
- K. A. Abdul Nazeer
- Ganapati Panda
- Yuri Boykov
- M. Sebastian
- Dmitrii Marin
- Meng Tang
- Satyasai Jagannath Nanda
In Statistics and Probability
- Ismail Ben Ayed
- K. A. Abdul Nazeer
- Ganapati Panda
- Yuri Boykov
- M. Sebastian
- Dmitrii Marin
- Meng Tang
- Satyasai Jagannath Nanda
Citations in the corpus
- Secrets of GrabCut and Kernel K-Means (2015, methodology): “It is also interesting that discrete version of K-modes for histograms [30, 15] define mode μ = (μ(1), .”
- Clustering Algorithms Research (2008, unknown): “尽管在一些情况下,潜类算法比 K-modes-CGC 算法执行得更好,但 Chaturvedi 猜测在另外一些情况下,潜类 算法很可能是不可行的.”
- Improving the Accuracy and Efficiency of the k-means Clustering Algorithm (2009, methodology): “A variant of the k-means algorithm is the k-modes [2] [5] method which replaces the means of clusters with modes.”
- A survey on nature inspired metaheuristic algorithms for partitional clustering (2014, background): “(determines the closest cluster centers for all the data points), X-means [38] (determines the best number of clusters K by optimizing a criterion such as Akaike Information Criterion (AIC) or Bayesian Information Criterion (BIC)), k-harmonic means [39] (instead of minimum of Euclidean distance the ”