How Many Clusters? An Information-Theoretic Perspective
From MaRDI portal
Publication:4664508
DOI10.1162/0899766042321751zbMath1062.82045DBLPjournals/neco/StillB04arXivphysics/0303011OpenAlexW2168614937WikidataQ52969276 ScholiaQ52969276MaRDI QIDQ4664508
Publication date: 5 April 2005
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/physics/0303011
Pattern recognition, speech recognition (68T10) Neural nets applied to problems in time-dependent statistical mechanics (82C32) Information theory (general) (94A15)
Related Items (7)
A novel dynamic minimum spanning tree based clustering method for image mining ⋮ Resampling approach for cluster model selection ⋮ The Deterministic Information Bottleneck ⋮ Enhancing the efficiency of a decision support system through the clustering of complex rule-based knowledge bases and modification of the inference algorithm ⋮ The Information Bottleneck and Geometric Clustering ⋮ A Robust Information Clustering Algorithm ⋮ Optimal causal inference: Estimating stored information and approximating causal architecture
Cites Work
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- A Mathematical Theory of Communication
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- On stochastic complexity and nonparametric density estimation
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Stability-Based Validation of Clustering Solutions
This page was built for publication: How Many Clusters? An Information-Theoretic Perspective