On K-means algorithm with the use of mahalanobis distances

Igor Melnykov, Volodymyr Melnykov

Research output: Contribution to journalArticlepeer-review

48 Citations (Scopus)

Abstract

The K-means algorithm is commonly used with the Euclidean metric. While the use of Mahalanobis distances seems to be a straightforward extension of the algorithm, the initial estimation of covariance matrices can be complicated. We propose a novel approach for initializing covariance matrices.

Original languageEnglish
Pages (from-to)88-95
Number of pages8
JournalStatistics and Probability Letters
Volume84
Issue number1
DOIs
Publication statusPublished - Jan 2014

Keywords

  • Initialization
  • K-means algorithm
  • Mahalanobis distance

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'On K-means algorithm with the use of mahalanobis distances'. Together they form a unique fingerprint.

Cite this