On hierarchical clustering in sufficient dimension reduction

Chaeyeon Yoo, Younju Yoo, Hye Yeon Um, Jae Keun Yoo

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The K-means clustering algorithm has had successful application in sufficient dimension reduction. Unfortunately, the algorithm does have reproducibility and nestness, which will be discussed in this paper. These are clear deficits for the K-means clustering algorithm; however, the hierarchical clustering algorithm has both reproducibility and nestness, but intensive comparison between K-means and hierarchical clustering algorithm has not yet been done in a sufficient dimension reduction context. In this paper, we rigorously study the two clustering algorithms for two popular sufficient dimension reduction methodology of inverse mean and clustering mean methods throughout intensive numerical studies. Simulation studies and two real data examples confirm that the use of hierarchical clustering algorithm has a potential advantage over the K-means algorithm.

Original languageEnglish
Pages (from-to)431-443
Number of pages13
JournalCommunications for Statistical Applications and Methods
Volume27
Issue number4
DOIs
StatePublished - 1 Jul 2020

Keywords

  • Central subspace
  • Hierarchical clustering
  • Informative predictor subspace
  • K-means clustering
  • Multivariate slicing
  • Sufficient dimension reduction

Fingerprint

Dive into the research topics of 'On hierarchical clustering in sufficient dimension reduction'. Together they form a unique fingerprint.

Cite this