Key points are not available for this paper at this time.
We demonstrate that it is possible to approximate the mutual information arbitrarily closely in probability by calculating the relative frequencies on appropriate partitions and achieving conditional independence on the rectangles of which the partitions are made. Empirical results, including a comparison with maximum-likelihood estimators, are presented.
Building similarity graph...
Analyzing shared references across papers
Loading...
Georges A. Darbellay
École Polytechnique Fédérale de Lausanne
Igor Vajda
Obuda University
IEEE Transactions on Information Theory
Czech Academy of Sciences, Institute of Information Theory and Automation
Building similarity graph...
Analyzing shared references across papers
Loading...
Darbellay et al. (Sat,) studied this question.
synapsesocial.com/papers/69daa37e387cf706986871d2 — DOI: https://doi.org/10.1109/18.761290
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: