Rényi Entropy
Versandkostenfrei!
Versandfertig in 6-10 Tagen
22,99 €
inkl. MwSt.
PAYBACK Punkte
11 °P sammeln!
High Quality Content by WIKIPEDIA articles! In information theory, the Rényi entropy, a generalisation of Shannon entropy, is one of a family of functionals for quantifying the diversity, uncertainty or randomness of a system. It is named after Alfréd Rényi. Higher values of , approaching infinity, give a Rényi entropy which is increasingly determined by consideration of only the highest probability events. Lower values of , approaching zero, give a Rényi entropy which increasingly weights all possible events more equally, regardless of their probabilities. The intermediate case =1 gives ...
High Quality Content by WIKIPEDIA articles! In information theory, the Rényi entropy, a generalisation of Shannon entropy, is one of a family of functionals for quantifying the diversity, uncertainty or randomness of a system. It is named after Alfréd Rényi. Higher values of , approaching infinity, give a Rényi entropy which is increasingly determined by consideration of only the highest probability events. Lower values of , approaching zero, give a Rényi entropy which increasingly weights all possible events more equally, regardless of their probabilities. The intermediate case =1 gives the Shannon entropy, which has special properties. The Rényi entropies are important in ecology and statistics as indices of diversity.
