Information theoretic hierarchical clustering
Summary: Hierarchical clustering has been extensively used in practice, where clusters can be assigned and analyzed simultaneously, especially when estimating the number of clusters is challenging. However, due to the conventional proximity measures recruited in these algorithms, they are only capable of detecting mass-shape clusters and encounter problems in identifying complex data structures. Here, we introduce two bottom-up hierarchical approaches that exploit an information theoretic proximity measure to explore the nonlinear boundaries between clusters and extract data structures further than the second order statistics. Experimental results on both artificial and real datasets demonstrate the superiority of the proposed algorithm compared to conventional and information theoretic clustering algorithms reported in the literature, especially in detecting the true number of clusters.
- 10.1162/153244303322753742
- A Mathematical Theory of Communication
- An introduction to support vector machines and other kernel-based learning methods.
- Cure: An efficient clustering algorithm for large databases
- Finding the Number of Clusters in a Dataset
- Hierarchical clustering schemes
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- On Estimation of a Probability Density Function and Mode
- An information-theoretic approach to hierarchical clustering of uncertain data
- Hierarchical clustering based on the information bottleneck method using a control process
- Data clustering using hierarchical deterministic annealing and higher order statistics
- KL-based criterion hierarchical text clustering
- Determining the number of clusters using information entropy for mixed data
- Information Theoretical Clustering Is Hard to Approximate
- Hierarchical clustering based on multi-scale information fusion
- Information-based clustering
- A novel scale-invariant, dynamic method for hierarchical clustering of data affected by measurement uncertainty
- Generalized twin Gaussian processes using Sharma-Mittal divergence
This page was built for publication: Information theoretic hierarchical clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657546)
