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
相关论文
共 22 条
  • [1] Unsupervised curve clustering using B-splines
    Abraham, C
    Cornillon, PA
    Matzner-Lober, E
    Molinari, N
    [J]. SCANDINAVIAN JOURNAL OF STATISTICS, 2003, 30 (03) : 581 - 595
  • [2] [Anonymous], ADV METHODS MARKETIN
  • [3] CHANG WC, 1983, APPL STAT-J ROY ST C, V32, P267
  • [4] The consistency of estimators in finite mixture models
    Cheng, RCH
    Liu, WB
    [J]. SCANDINAVIAN JOURNAL OF STATISTICS, 2001, 28 (04) : 603 - 616
  • [5] De Soete G., 1994, New approaches in classification and data analysis, P212, DOI DOI 10.1007/978-3-642-51175-2_24
  • [6] GENERALIZATIONS OF GLIVENKO-CANTELLI THEOREM
    DEHARDT, J
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1971, 42 (06): : 2050 - &
  • [7] García-Escudero LA, 1999, ANN STAT, V27, P1061
  • [8] COMPARING PARTITIONS
    HUBERT, L
    ARABIE, P
    [J]. JOURNAL OF CLASSIFICATION, 1985, 2 (2-3) : 193 - 218
  • [9] RATES OF CONVERGENCE IN THE SOURCE-CODING THEOREM, IN EMPIRICAL QUANTIZER DESIGN, AND IN UNIVERSAL LOSSY SOURCE-CODING
    LINDER, T
    LUGOSI, G
    ZEGER, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) : 1728 - 1740
  • [10] Peskir G., 2000, UNIFORM LAWS LARGE N