Shannon’s entropy of partitions determined by hierarchical clustering trees in asymmetry and dimension identification
From MaRDI portal
Publication:5042179
DOI10.1080/03610918.2020.1788586OpenAlexW3039564598MaRDI QIDQ5042179
J. S. Corredor, Adolfo J. Quiroz
Publication date: 18 October 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2020.1788586
Cites Work
- A Mathematical Theory of Communication
- Intrinsic dimension identification via graph-theoretic methods
- Statistical properties of the single linkage hierarchical clustering estimator
- Gaussian limits for generalized spacings
- Entropy for random partitions and its applications
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- Trimmed means for functional data
- Local angles and dimension estimation from data on manifolds
- DANCo: an intrinsic dimensionality estimator exploiting angle and norm concentration
- Cluster Analysis
- A Method for Comparing Two Hierarchical Clusterings
- Limit Theorems for φ-Divergences Based onk-Spacings
- Random Geometric Graphs
- Applied Multivariate Statistical Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Shannon’s entropy of partitions determined by hierarchical clustering trees in asymmetry and dimension identification