Quantifying Data Dependencies with Rényi Mutual Information and Minimum Spanning Trees
In this study, we present a novel method for quantifying dependencies in multivariate datasets, based on estimating the Rényi mutual information by minimum spanning trees (MSTs). The extent to which random variables are dependent is an important question, e.g., for uncertainty quantification and sen...
Main Authors: | Anne Eggels, Daan Crommelin |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/2/100 |
Similar Items
-
Some models for inverse minimum spanning tree problem with uncertain edge weights
by: Sagarika Biswal, et al.
Published: (2022-10-01) -
Rényi Entropy and Rényi Divergence in Product MV-Algebras
by: Dagmar Markechová, et al.
Published: (2018-08-01) -
Robust Test Statistics Based on Restricted Minimum Rényi’s Pseudodistance Estimators
by: María Jaenada, et al.
Published: (2022-04-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2006-02-01) -
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2006-02-01)