Strong Consistency of Reduced K-means Clustering

被引:17
|
作者
Terada, Yoshikazu [1 ]
机构
[1] Osaka Univ, Grad Sch Engn Sci, Toyonaka, Osaka 5608531, Japan
关键词
clustering; dimension reduction; k-means; CENTRAL-LIMIT-THEOREM; FACTORIAL;
D O I
10.1111/sjos.12074
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously obtained. In this paper, the relationship between conventional k-means clustering and reduced k-means clustering is discussed. Conditions ensuring almost sure convergence of the estimator of reduced k-means clustering as unboundedly increasing sample size have been presented. The results for a more general model considering conventional k-means clustering and reduced k-means clustering are provided in this paper. Moreover, a consistent selection of the numbers of clusters and dimensions is described.
引用
收藏
页码:913 / 931
页数:19
相关论文
共 50 条
  • [1] STRONG CONSISTENCY OF K-MEANS CLUSTERING
    POLLARD, D
    [J]. ANNALS OF STATISTICS, 1981, 9 (01): : 135 - 140
  • [2] On the strong consistency of feature-weighted k-means clustering in a nearmetric space
    Chakraborty, Saptarshi
    Das, Swagatam
    [J]. STAT, 2019, 8 (01):
  • [3] Variance Reduced K-means Clustering
    Zhao, Yawei
    Ming, Yuewei
    Liu, Xinwang
    Zhu, En
    Yin, Jianping
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 8187 - 8188
  • [4] On strong consistency of kernel k-means: A Rademacher complexity approach
    Chakrabarty, Anish
    Das, Swagatam
    [J]. STATISTICS & PROBABILITY LETTERS, 2022, 182
  • [5] Research on k-means Clustering Algorithm An Improved k-means Clustering Algorithm
    Shi Na
    Liu Xumin
    Guan Yong
    [J]. 2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 63 - 67
  • [6] K-Means Cloning: Adaptive Spherical K-Means Clustering
    Hedar, Abdel-Rahman
    Ibrahim, Abdel-Monem M.
    Abdel-Hakim, Alaa E.
    Sewisy, Adel A.
    [J]. ALGORITHMS, 2018, 11 (10):
  • [7] Strong consistency of factorial -means clustering
    Terada, Yoshikazu
    [J]. ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2015, 67 (02) : 335 - 357
  • [8] Selection of K in K-means clustering
    Pham, DT
    Dimov, SS
    Nguyen, CD
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2005, 219 (01) : 103 - 119
  • [9] Stability of k-means clustering
    Ben-David, Shai
    Pal, Ddvid
    Simon, Hans Ulrich
    [J]. LEARNING THEORY, PROCEEDINGS, 2007, 4539 : 20 - +
  • [10] Geodesic K-means Clustering
    Asgharbeygi, Nima
    Maleki, Arian
    [J]. 19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 3450 - 3453