Advancing Shannon entropy for measuring diversity in systems

DOI10.1155/2017/8715605MaRDI QIDQ1722720zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 18 February 2019

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/8715605

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• An entropy based measure for comparing distributions of complexity
• Variability as a better characterization of Shannon entropy
• scientific article; zbMATH DE number 826942
• Entropic nonextensivity: A possible measure of complexity
• Biological diversity: distinct distributions can lead to the maximization of Rao's quadratic entropy

Cites work

• scientific article; zbMATH DE number 1728538 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2040652 (Why is no real title available?)
• scientific article; zbMATH DE number 2079883 (Why is no real title available?)
• A graph-based hyper-heuristic for educational timetabling problems
• A hyper-heuristic approach to sequencing by hybridization of DNA sequences
• A method for solving traveling-salesman problems
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• Complexity of DNA sequencing by hybridization.
• DNA Sequencing by Hybridization via Genetic Search
• DNA sequencing-tabu and scatter search combined
• Dealing with repetitions in sequencing by hybridization
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• Handbook of metaheuristics
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Measuring instance difficulty for combinatorial optimization problems
• Optimization by simulated annealing
• Reducibility among combinatorial problems
• Search Methodologies

Cited in

(3)

• Mathematical bounds on Shannon entropy given the abundance of the \(i\)th most abundant taxon
• On stochastic properties of past varentropy with applications.
• Dynamic analysis for a Kaldor-Kalecki model of business cycle with time delay and diffusion effect

Describes a project that uses

Uses Software

• Hyperheuristics
• Tabu search

This page was built for publication: Advancing Shannon entropy for measuring diversity in systems

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