Statistic complexity: Combining Kolmogorov complexity with an ensemble approach

15Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

Background: The evaluation of the complexity of an observed object is an old but outstanding problem. In this paper we are tying on this problem introducing a measure called statistic complexity. Methodology/Principal Findings: This complexity measure is different to all other measures in the following senses. First, it is a bivariate measure that compares two objects, corresponding to pattern generating processes, on the basis of the normalized compression distance with each other. Second, it provides the quantification of an error that could have been encountered by comparing samples of finite size from the underlying processes. Hence, the statistic complexity provides a statistical quantification of the statement 'X is similarly complex as Y'. Conclusions: The presented approach, ultimately, transforms the classic problem of assessing the complexity of an object into the realm of statistics. This may open a wider applicability of this complexity measure to diverse application areas. © 2010 Frank Emmert-Streib.

Cite

CITATION STYLE

APA

Emmert-Streib, F. (2010). Statistic complexity: Combining Kolmogorov complexity with an ensemble approach. PLoS ONE, 5(8). https://doi.org/10.1371/journal.pone.0012256

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free