Dependence assessment based on generalized relative complexity: application to sampling network design
From MaRDI portal
Publication:340137
DOI10.1007/S11009-016-9495-6zbMATH Open1349.94105OpenAlexW2316487028MaRDI QIDQ340137FDOQ340137
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
Recommendations
Cites Work
- On Information and Sufficiency
- Axiomatic characterizations of information measures
- On measures of information and their characterizations
- Fundamental properties of Tsallis relative entropy
- Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity.
- A study on sampling design for optimal prediction of space-time stochastic processes
- Optimal monitoring network designs
- What is complexity?
- Effect of data transformations on predictive risk indicators
- Multifractal analyses of music sequences
- A generalized statistical complexity measure: applications to quantum systems
- Complexity explained.
- The generalized cross entropy method, with applications to probability density estimation
Cited In (1)
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)