Statistic complexity: Combining Kolmogorov complexity with an ensemble approach

PLoS ONE

Volumn 5, Issue 8, 2010, Pages

  Emmert Streib, Frank ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CALCULATION; CONTROLLED STUDY; FINITE ELEMENT ANALYSIS; GENETIC ANALYSIS; INTERMETHOD COMPARISON; KOLMOGOROV SMIRNOV TEST; MATHEMATICAL MODEL; MEASUREMENT ERROR; STATISTIC COMPLEXITY; STATISTICAL ANALYSIS; ALGORITHM; ANALYSIS OF VARIANCE; EVALUATION; METHODOLOGY; STANDARD; STATISTICS;

ALGORITHMS; ANALYSIS OF VARIANCE; STATISTICS AS TOPIC;

EID: 77957887947     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0012256     Document Type: Article

References (38)

1. Bar-Yam Y (1997) Dynamics of Complex Systems. Perseus Books.
2. Nicolis G, Prigogine I (1989) Exploring Complexity. Freeman.
3. Prokopenko M, Boschetti F, Ryan A (2009) An information-theoretic primer on complexity, self-organization, and emergence. Complexity 15: 11-28.
4. Schuster H (2002) Complex Adaptive Systems. Scator Verlag.
5. Wolfram S (1983) Statistical mechanics of cellular automata. Phys Rev E 55: 601-644.
6. Dehmer M (2008) A novel method for measuring the structural information content of networks. Cybernetics and Systems 39: 825-842.
7. Dehmer M, Barbarini N, Varmuza K, Graber A (2009) A large scale analysis of information-theoretic network complexity measures using chemical structures. PLoS ONE 4: e8057.
8. Watts D, Strogatz S (1998) Collective dynamics of 'small-world' networks. Nature 393: 440-442.
9. Kolmogorov AN (1965) Three approaches to the quantitative definition of 'information'. Problems of Information Transmission 1: 1-7.
10. Li M, Vitányi P (1997) An Introduction to Kolmogorov Complexity and Its Applications Springer.
11. Solomonoff R (1960) A preliminary report on a general theory of inductive inference. Technical Report V-131, Zator Co., Cambridge, Ma.
12. López-Ruiza R, Mancinib H, Calbet X (1995) A statistical measure of complexity. Physics Letters A 209: 321-326.
13. Badii R, Politi A (1997) Complexity: Hierarchical Structures and Scaling in Physics. Cambridge University Press, Cambridge.
14. Bennett C (1988) Logical depth and physical complexity. In: Herken R, ed. The Universal Turing Machine- a Half-Century Survey Oxford University Press. pp 227-257.
15. Crutchfield JP, Young K (1989) Inferring statistical complexity. Phys Rev Lett 63: 105-108.
16. Gell-Mann M, Lloyd S (1998) Information measures, effective complexity, and total information. Complexity 2: 44-52.
17. Grassberger P (1986) Toward a quantitative theory of self-generated complexity. Int J Theor Phys 25: 907-938.
18. Lloyd S, Pagels H (1988) Complexity as thermodynamic depth. Annals of Physics 188: 186-213.
19. Zurek W, ed (1990) Complexity, Entropy and the Physics of Information. Addison-Wesley, Redwood City.
20. Grassberger P (1989) Problems in quantifying self-generated complexity. Helvetica Physica Acta 62: 489-511.
21. Chaitin G (1966) On the length of programs for computing finite binary sequences. Journal of the ACM. pp 547-569.
22. Crutchfield J, Packard N (1983) Symbolic dynamics of noisy chaos. Physica D 7: 201-223.
23. Bialek W, Nemenman I, Tishby N (2001) Predictability, complexity, and learning. Neural Computation 13: 2409-2463.
24. Cilibrasi R, Vitányi P (2005) Clustering by compression. IEEE Transactions Information Theory 51: 1523-1545.
25. Casella G, Berger R (2002) Statistical Inference. Duxbury Press.
26. Mood A, Graybill F, Boes D (1974) Introduction to the Theory of Statistics McGrw-Hill.
27. Li M, Chen X, Li X, Ma B, Vitányi P (2004) The similarity metric. IEEE Transactions on Information Theory 50: 3250-3264.
28. Cebrian M, Alfonseca M, Ortega A (2005) Common pitfalls using the normalized compression distance: What to watch out for in a compressor. Communications in Information and Systems 5: 367-384.
29. Emmert-Streib F (2010) Exploratory analysis of spatiotemporal patterns of cellular automata by clustering compressibility. Physical Review E 81: 026103.
30. Conover W (1999) Practical Nonparametric Statistics. John Wiley & Sons, New York.
31. Smirnov N (1939) Estimate of deviation between empirical distribution functions in two independent samples. Bulletin Moscow University 2: 3-16.
32. Milbrodt H, Strasser H (1990) On the asymptotic power of the two-sided kolmogorov-smirnov test. Journal of Statistical Planning and Inference 26: 1-23.
33. Mattos T, Moreira J (2004) Universality Classes of Chaotic Cellular Automata. Brazilian Journal of Physics 34: 448-451.
34. Crutchfield J, Feldman D (1997) Statistical complexity of simple onedimensional spin systems. Phys Rev E 55: R1239.
35. Feldman D, Crutchfield J (1998) Measures of statistical complexity: Why? Physics Letters A 238: 244-252.
36. Lehman E (2005) Testing Statistical Hypotheses. Springer.
37. Emmert-Streib F (2007) The chronic fatigue syndrome: A comparative pathway analysis. Journal of Computational Biology 14: 961-972.
38. R Development Core Team (2008) R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0.