التفاصيل البيبلوغرافية
| العنوان: |
On hierarchical clustering in sufficient dimension reduction. |
| المؤلفون: |
Chaeyeon Yoo, Younju Yoo, Hye Yeon Um, Jae Keun Yoo |
| المصدر: |
Communications for Statistical Applications & Methods; Jul2020, Vol. 27 Issue 4, p431-443, 13p |
| مصطلحات موضوعية: |
ALGORITHMS, K-means clustering |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Communications for Statistical Applications & Methods is the property of Korean Statistical Society and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |