Geodesic Clustering for Covariance Matrices
- Authors
- Lee, Haesung; Ahn, Hyun-Jung; Kim, Kwang-Rae; Kim, Peter T.; Koo, Ja-Yong
- Issue Date
- 7월-2015
- Publisher
- KOREAN STATISTICAL SOC
- Keywords
- Euclidean distance; extrinsic mean; geodesic distance; intrinsic mean; K-means; KOSPI; Riemannian geometry; SPD; stock data
- Citation
- COMMUNICATIONS FOR STATISTICAL APPLICATIONS AND METHODS, v.22, no.4, pp.321 - 331
- Indexed
- KCI
- Journal Title
- COMMUNICATIONS FOR STATISTICAL APPLICATIONS AND METHODS
- Volume
- 22
- Number
- 4
- Start Page
- 321
- End Page
- 331
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/93136
- DOI
- 10.5351/CSAM.2015.22.4.321
- ISSN
- 2287-7843
- Abstract
- The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Political Science & Economics > Department of Statistics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.