Dependence assessment based on generalized relative complexity: application to sampling network design

DOI10.1007/S11009-016-9495-6MaRDI QIDQ340137zbMATH OpenOpenAlexFDO

Authors M. C. Bueso, Francisco Alonso, J. M. Angulo

Publication date 11 November 2016

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11009-016-9495-6

zbMATH Keywords

spatial samplingShannon entropystatistical complexitygeneralized mutual informationRényi entropy

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Measures of information, entropy (94A17)

Recommendations

• Generalized statistical complexity measure
• On generalized measures of entropy and dependence
• On measurement of stochastic dependence in multivariate data
• Monotone measures of statistical complexity
• Spatial sampling design based on stochastic complexity.

Cites work

• A generalized statistical complexity measure: applications to quantum systems
• A study on sampling design for optimal prediction of space-time stochastic processes
• Axiomatic characterizations of information measures
• Complexity explained.
• Effect of data transformations on predictive risk indicators
• Fundamental properties of Tsallis relative entropy
• Multifractal analyses of music sequences
• On Information and Sufficiency
• On measures of information and their characterizations
• Optimal monitoring network designs
• Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity.
• The generalized cross entropy method, with applications to probability density estimation
• What is complexity?

Cited in

(1)

• An application of information theory to stochastic classical gravitational fields

This page was built for publication: Dependence assessment based on generalized relative complexity: application to sampling network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340137)