On -means algorithm with the use of Mahalanobis distances
Authors:
- Igor MelnykovIMIgor Melnykov
- Volodymyr MelnykovVMVolodymyr Melnykov
- 1 January 2014
- journal article
- Published by Elsevier in Statistics & Probability Letters
- Vol. 84, 88-95
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Choice of Metrics for Clustering AlgorithmsENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference, 2015
- MixSim: AnRPackage for Simulating Data to Study Performance of Clustering AlgorithmsJournal of Statistical Software, 2012
- A new algorithm for initial cluster centers in k-means algorithmPattern Recognition Letters, 2011
- Simulating Data to Study Performance of Finite Mixture Modeling and Clustering AlgorithmsJournal of Computational and Graphical Statistics, 2010
- An empirical comparison of four initialization methods for the K-Means algorithmPattern Recognition Letters, 1999
- Comparing partitionsJournal of Classification, 1985
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936