On hierarchical clustering in sufficient dimension reduction
- 주제(키워드) Central subspace , Hierarchical clustering , Informative predictor subspace , K-means clustering , Multivariate slicing , Sufficient dimension reduction
- 등재 SCOPUS, KCI등재
- 발행기관 Korean Statistical Society
- 발행년도 2020
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000175039
- 본문언어 영어
- Published As http://dx.doi.org/10.29220/CSAM.2020.27.4.431
초록/요약
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. © 2020 The Korean Statistical Society, and Korean International Statistical Society.
more