Exploratory analysis of spatiotemporal patterns of cellular automata by clustering compressibility

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 81, Issue 2, 2010, Pages

  Emmert Streib, Frank ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION RESULTS; DISSIMILARITY MEASURES; EXPLORATORY ANALYSIS; GAIN INSIGHT; HIER-ARCHICAL CLUSTERING; INITIAL CONDITIONS; KOLMOGOROV COMPLEXITY; NORMALIZED COMPRESSION DISTANCE; NUMERICAL RESULTS; ORGANIZATIONAL STRUCTURES; RANDOM INITIAL CONDITIONS; SPATIOTEMPORAL PATTERNS; UNIVARIATE;

COMPRESSIBILITY; COMPUTATIONAL COMPLEXITY; NUMERICAL ANALYSIS; PATTERN RECOGNITION SYSTEMS; TRANSLATION (LANGUAGES);

CELLULAR AUTOMATA;

EID: 76749153776     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.81.026103     Document Type: Article

References (45)

1. J. Von Neumann and A. Burks, Theory of Self-Reproducing Automata (University of Illinois Press, Urbana, 1966).
2. U. Frisch, B. Hasslacher, and Y. Pommeau, Phys. Rev. Lett. 56, 1505 (1986). 10.1103/PhysRevLett.56.1505
3. B. Madore and W. Freedman, Science 222, 615 (1983). 10.1126/science.222. 4624.615
4. Y. Oono and M. Kohmoto, Phys. Rev. Lett. 55, 2927 (1985). 10.1103/PhysRevLett.55.2927
5. M. Cook, Adv. Complex Syst. 15, 1 (2004).
6. K. Lindgren and M. G. Nordahl, Complex Systems 4, 299 (1990).
7. S. Wolfram, Rev. Mod. Phys. 55, 601 (1983). 10.1103/RevModPhys.55.601
8. S. Wolfram, Physica D 10, 1 (1984). 10.1016/0167-2789(84)90245-8
9. P. Binder, J. Phys. A 24, L31 (1991). 10.1088/0305-4470/24/1/007
10. A. Wuensche, Complexity 4, 47 (1999). 10.1002/(SICI)1099-0526(199901/02) 4:3<47::AID-CPLX9>3.0.CO;2-V
11. J.-C. Dubacq, B. Durand, and E. Formenti, Theor. Comput. Sci. 259, 271 (2001). 10.1016/S0304-3975(00)00012-8
12. H. A. Gutowitz, Physica D 45, 136 (1990). 10.1016/0167-2789(90)90179-S
13. C. Langton, Physica D 42, 12 (1990). 10.1016/0167-2789(90)90064-V
14. R. Badii and A. Politi, Complexity: Hierarchical Structures and Scaling in Physics (Cambridge University Press, Cambridge, 1997). 10.1017/ CBO9780511524691
15. C. Bennett, in The Universal Turing Machine-A Half-Century Survey, edited by, R. Herken, (Oxford University Press, New York, 1988), pp. 227-257.
16. M. Gell-Mann and S. Lloyd, Complexity 2, 44 (1998). 10.1002/(SICI)1099- 0526(199609/10)2:1<44::AID-CPLX10>3.0.CO;2-X
17. P. Grassberger, Int. J. Theor. Phys. 25, 907 (1986). 10.1007/BF00668821
18. A. N. Kolmogorov, Probl. Inf. Transm. 1, 1 (1965).
19. S. Lloyd and H. Pagels, Ann. Phys. 188, 186 (1988). 10.1016/0003-4916(88) 90094-2
20. R. Solomonoff, A Preliminary Report on a General Theory of Inductive Inference (Revision of Report No. V-131), Contract AF 49(639)-376, Report ZTB-138, Zator Co. (1960), http://www.world.std.com/~rjs.pubs.html
21. H. Zenil, e-print arXiv:0910.4042, Complex Syst. (to be published).
22. G. Chaitin, J. Assoc. Comput. Mach. 13, 547 (1966). 10.1145/321356.321363
23. J. Crutchfield and N. Packard, Physica D 7, 201 (1983). 10.1016/0167-2789(83)90127-6
24. W. Bialek, I. Nemenman, and N. Tishby, Neural Comput. 13, 2409 (2001). 10.1162/089976601753195969
25. R. Cilibrasi and P. Vitányi, IEEE Trans. Inf. Theory 51, 1523 (2005). 10.1109/TIT.2005.844059
26. M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications (Springer, New York, 1997).
27. R. Cilibrasi and P. Vitányi, IEEE Trans. Knowl. Data Eng. 19, 370 (2007). 10.1109/TKDE.2007.48
28. M. Nykter, N. D. Price, A. Larjo, T. Aho, S. A. Kauffman, O. Yli-Harja, and I. Shmulevich, Phys. Rev. Lett. 100, 058702 (2008). 10.1103/PhysRevLett.100. 058702
29. N. Krasnogor and D. A. Pelta, Bioinformatics 20, 1015 (2004). 10.1093/bioinformatics/bth031
30. P. Vitányi, F. Balbach, R. Cilibrasi, and M. Li, in Information Theory and Statistical Learning, edited by, F. Emmert-Streib, and, M. Dehmer, (Springer, New York, 2008), pp. 45-82.
31. A. Dhar, P. Lakdawala, G. Mandal, and S. Wadia, Phys. Rev. E 51, 3032 (1995). 10.1103/PhysRevE.51.3032
32. N. Fatès, in Discrete Models for Complex Systems (DMCS'03), edited by, M. Morvan, and, I. Rémila, 2003, Vol. AB, pp. 155-166, URL: http://www.dmtcs.org/proceedings/html/dmAB0113.abs.html
33. S. Wolfram, A New Kind of Science (Wolfram Media, Champaign, IL, 2002).
34. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi, IEEE Trans. Inf. Theory 50, 3250 (2004). 10.1109/TIT.2004.838101
35. S. Grumbach and F. Tahi, J. Info. Process. Manag. 30, 875 (1994). 10.1016/0306-4573(94)90014-0
36. J. S. Varre, J. P. Delahaye, and E. Rivals, German Conference on Bioinformatics, Koel, Germany, 1998 (unpublished).
37. A. Kocsor, A. Kertesz-Farkas, L. Kajan, and S. Pongor, Bioinformatics 22, 407 (2006). 10.1093/bioinformatics/bti806
38. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang, Bioinformatics 17, 149 (2001). 10.1093/bioinformatics/17.2.149
39. J. Ziv and A. Lempel, IEEE Trans. Inf. Theory 23, 337 (1977). 10.1109/TIT.1977.1055714
40. D. Huffman, Proc. IRE 40, 1098 (1952). 10.1109/JRPROC.1952.273898
41. M. Burrows and D. Wheeler, HP Report No. 124 (1994), http://www.hpl.hp. com/techreports/Compaq-DEC/SRC-RR-124.html
42. M. Cebrian, M. Alfonseca, and A. Ortega, Commun. Inf. Syst. 5, 367 (2005).
43. S. Theodoridis and K. Koutroumbas, Pattern Recognition (Academic Press, New York, 2003).
44. Here U (p,y) is a universal computer producing output x for input y and program p.
45. Spaces are just included for a better perception of the pattern.