Finding the number of clusters in a dataset: An information-theoretic approach

被引:532
|
作者
Sugar, CA [1 ]
James, GM [1 ]
机构
[1] Univ So Calif, Marshall Sch Business, Los Angeles, CA 90089 USA
关键词
cluster analysis; distortion; information theory; k-means clustering; mixture models;
D O I
10.1198/016214503000000666
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
One of the most difficult problems in cluster analysis is identifying the number of groups in a dataset. Most previously suggested approaches to this problem are either somewhat ad hoc or require parametric assumptions and complicated calculations. In. this article we develop a simple, yet powerful nonparametric method for choosing the number of clusters based on distortion, a quantity that measures the average distance, per dimension, between each observation and its closest cluster center. Our technique is computationally efficient and straightforward to implement. We demonstrate empirically its effectiveness, not only for choosing the number of clusters, but also for identifying underlying structure, on a wide range of simulated and real world datasets. In addition, we give a rigorous theoretical justification for the method based on information-theoretic ideas. Specifically, results from the subfield of electrical engineering known as rate distortion theory allow us to describe the behavior of the distortion in both the presence and absence of clustering. Finally, we note that these ideas potentially can be extended to a wide range of other statistical model selection problems.
引用
收藏
页码:750 / 763
页数:14
相关论文
共 50 条
  • [1] Finding the number of clusters in a dataset using an information theoretic hierarchical algorithm
    Aghagolzadeh, M.
    Soltanian-Zadeh, H.
    Araabi, B. N.
    Aghagolzadeh, A.
    [J]. 2006 13TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2006, : 1336 - +
  • [2] Finding number of clusters in single-step with similarity-based information-theoretic algorithm
    Temel, T.
    [J]. ELECTRONICS LETTERS, 2014, 50 (01) : 29 - U34
  • [3] How many clusters? An information-theoretic perspective
    Still, S
    Bialek, W
    [J]. NEURAL COMPUTATION, 2004, 16 (12) : 2483 - 2506
  • [4] Information-Theoretic Dataset Selection for Fast Kernel Learning
    Paiva, Antonio R. C.
    [J]. 2017 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2017, : 2088 - 2095
  • [5] An Information-theoretic Approach to Distribution Shifts
    Federici, Marco
    Tomioka, Ryota
    Forre, Patrick
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [6] An information-theoretic approach to steganography and watermarking
    Mittelholzer, T
    [J]. INFORMATION HIDING, PROCEEDINGS, 2000, 1768 : 1 - 16
  • [7] An information-theoretic approach to band selection
    Ahlberg, J
    Renhorn, I
    [J]. Targets and Backgrounds XI: Characterization and Representation, 2005, 5811 : 15 - 23
  • [8] Information-Theoretic Approach to Bidirectional Scaling
    Boso, Francesca
    Tartakovsky, Daniel M.
    [J]. WATER RESOURCES RESEARCH, 2018, 54 (07) : 4916 - 4928
  • [9] Information-theoretic approach to steganographic systems
    Ryabko, Boris
    Ryabko, Daniil
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2461 - +
  • [10] An Information-theoretic Approach to Hardness Amplification
    Maurer, Ueli
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 948 - 952