Cluster Analysis via Stochastic Approximation Monte CarloCluster Analysis via Stochastic Approximation Monte Carlo
- Other Titles
- Cluster Analysis via Stochastic Approximation Monte Carlo
- Authors
- 전수영; 이은표; 진서훈
- Issue Date
- 2009
- Publisher
- 한국자료분석학회
- Keywords
- k-means clustering; Stochastic approximation Monte Carlo; Local trap problem; Minimum partition error criterion.
- Citation
- Journal of The Korean Data Analysis Society, v.11, no.4, pp.1749 - 1760
- Indexed
- KCI
- Journal Title
- Journal of The Korean Data Analysis Society
- Volume
- 11
- Number
- 4
- Start Page
- 1749
- End Page
- 1760
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/121350
- ISSN
- 1229-2354
- Abstract
- The k-means clustering is one of the simplest unsupervised algorithm used generally in solving clustering problems. However, it may rely on the initial cluster seed and thus it is suffer from the local trap problem due to that its system has multiple local energy minima in a rugged energy landscape. Hence, the global optimal clustering may not be identified. This paper focuses on this problem, and thus we propose to use the Stochastic approximation Monte Carlo(SAMC) algorithm implementing the k-means clustering method to overcome the local trap problem in clustering analysis. SAMC is a general importance sampling and optimization algorithm to search the sample space broadly and escape from the local trap problem regardless of the initial point. The algorithm is tested on simulated and the real dataset, and compared with the k-means clustering algorithm. The numerical results are in favor of SAMC based on the minimization criterion.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Applied Statistics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.