A novel and effective method for quantifying complexity of nonlinear time series

DOI10.1016/J.CNSNS.2023.107773OpenAlexW4389509730MaRDI QIDQ6143073

Pengjian Shang, Binbin Shang

Publication date: 23 January 2024

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2023.107773

zbMATH Keywords

discretizationcomplexitytime series analysisdistribution entropy

Mathematics Subject Classification ID

Survival analysis and censored data (62Nxx) Communication, information (94Axx) Sufficiency and information (62Bxx)

Cites Work

• Unnamed Item
• On cumulative residual entropy of order statistics
• Some characterization results on generalized cumulative residual entropy measure
• On cumulative residual Kullback-Leibler information
• On cumulative entropies
• Generalized cumulative residual entropy for distributions with unrestricted supports
• Some new results on the cumulative residual entropy
• Bivariate extension of dynamic cumulative residual entropy
• Fractional cumulative residual Kullback-Leibler information based on Tsallis entropy
• Fractional cumulative residual entropy
• Multiscale transfer entropy: measuring information transfer on multiple time scales
• Measuring information transfer by dispersion transfer entropy
• On the dynamic cumulative residual entropy
• Generalized cumulative residual entropy and record values
• More on a new concept of entropy and information
• Testing Goodness-of-Fit for Exponential Distribution Based on Cumulative Residual Entropy
• Cumulative Residual Entropy: A New Measure of Information
• Approximate entropy as a measure of system complexity.
• General cumulative Kullback–Leibler information
• Randomness and degrees of irregularity.
• On Information and Sufficiency

This page was built for publication: A novel and effective method for quantifying complexity of nonlinear time series