Data compression and learning in time sequences analysis

Physica D: Nonlinear Phenomena

Volumn 180, Issue 1-2, 2003, Pages 92-107

  Puglisi, A ^a,b   Benedetto, D ^a   Caglioti, E ^a   Loreto, V ^a,b   Vulpiani, A ^a,b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b INFM   (Italy)

Author keywords

Characterization of complexity; Compression algorithm; Time sequence analysis

Indexed keywords

CHAOS THEORY; CHARACTER RECOGNITION; CORRELATION METHODS; GENETIC ALGORITHMS; LEARNING ALGORITHMS; MARKOV PROCESSES; OPTIMIZATION; TIME SERIES ANALYSIS;

DYNAMICAL SYSTEMS;

DATA COMPRESSION;

EID: 0038284954     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-2789(03)00047-2     Document Type: Article

References (49)

1. H. Kantz, T. Schreiber, Nonlinear Time Series Analysis, Cambridge Nonlinear Science Series, Cambridge University Press, Cambridge, 1997.
2. H.D.I. Abarbanel, Analysis of Observed Chaotic Data, Springer, New York, 1996.
3. R. Badii, A. Politi, Complexity, Hierarchical Structures and Scaling in Physics, Cambridge University Press, Cambridge, 1997.
4. Shannon C.E., The Bell Syst. Tech. J. 27:1948;623.
5. W.H. Zurek (Ed.), Complexity, Entropy and Physics of Information, Addison-Wesley, Redwood City, 1990.
6. Kolmogorov A.N., Prob. Inform. Trans. 1:1965;1.
7. Chaitin G.J., J. Assoc. Comp. Mach. 13:1966;547.
8. G.J. Chaitin, Information, Randomness and Incompleteness, World Scientific, Singapore, 1990.
9. R.J. Solomonoff, Inform. Contr. 7 (1964) 1 and 224.
10. M. Li, P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer, Berlin, 1997.
11. Ziv J., Merhav N., IEEE Trans. Inform. Theory. 39:1993;1270.
12. Milosavljević A., Mach. Learn. 21:1995;35-50.
13. M. Farach, M. Noordewier, S. Savari, L. Shepp, A. Wyner, J. Ziv, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 22-24, 1995, pp. 48-57.
14. Verdú S., Fifty years of Shannon theory. IEEE Trans. Inform. Theory. 44:1998;2057.
15. D. Lind, B. Marcus, Symbolic Dynamic and Coding, Cambridge University Press, Cambridge, 1995.
16. V. Benci, C. Bonanno, S. Galatolo, G. Menconi, M. Virgilio, Preprint cond-mat/0210654, and references therein.
17. Boffetta G., Cencini M., Falcioni M., Vulpiani A., Phys. Rep. 356:2002;367.
18. T.C. Bell, J.C. Cleary, I.H. Witten, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
19. W.J. Teahan, in: Proceedings of the International Conference on Content-based Multimedia Information Access (RIAO 2000), CID-CASIS, Paris, 2000, pp. 943-961.
20. P. Juola, in: Proceedings of the New Methods in Language Processing 3, Sydney, 1998.
21. El-Yaniv R., Fine S., Tishby N., Adv. Neural Inform. Process. Syst. 10:1997;465-471.
22. N. Thaper, MS in Computer Science, Masters Thesis, MIT Press, Cambridge, MA, 2001.
23. O.V. Kukushkina, A.A. Polikarpov, D.V. Khmelev, Problemy Peredachi Inform. 37 (2000) 96-108 (in Russian). Translated in English in Problems Inform. Trans. 37 (2001) 172-184.
24. M. Li, Private communication.
25. Benedetto D., Caglioti E., Loreto V., Phys. Rev. Lett. 88:2002;048702.
26. Li M., Badger J., Chen X., Kwong S., Kearney P., Zhang H., Bioinformatics. 17:2001;149-154.
27. Grumbach S., Tahi F., Inform. Process. Manage. 30:1994;875-886.
28. D. Loewenstern, et al., DIMACS Technical Report 95-04.
29. http://www.gzip.org/.
30. A. Lempel, J. Ziv, IEEE Trans. Inform. Theory 23 (1977) 337-343.
31. A.I. Khinchin, Mathematical Foundations of Information Theory, Dover, New York, 1957.
32. D. Welsh, Codes and Cryptography, Clarendon Press, Oxford, 1989.
33. Crutchfield J.P., Packard N.H., Int. J. Theor. Phys. 21:1982;433-466 Crutchfield J.P., Packard N.H., Physica D. 7:1983;201-223.
34. Crutchfield J.P., Packard N.H., Int. J. Theor. Phys. 21:1982;433-466 Crutchfield J.P., Packard N.H., Physica D. 7:1983;201-223.
35. Grassberger P., Int. J. Theor. Phys. 25:1986;907-938 P. Grassberger, in: H. Atmanspacher, H. Scheingraber (Eds.), Large Information Dynamics, Plenum Press, New York, 1991, pp. 15-33.
36. Grassberger P., Int. J. Theor. Phys. 25:1986;907-938 P. Grassberger, in: H. Atmanspacher, H. Scheingraber (Eds.), Large Information Dynamics, Plenum Press, New York, 1991, pp. 15-33.
37. J.P. Crutchfield, D.P. Feldman, cond-mat/0102181.
38. Wyner A.D., Ziv J., Proc. IEEE. 82:1994;872-877.
39. Savari A., IEEE Trans. Inform. Theory. 44:1998;787-791.
40. J.R. Pierce, Introduction to Information Theory: Symbols, Signals and Noise, Dover, New York, 1980.
41. P. Grassberger, Data compression and entropy estimates by non-sequential recursive pair substitution, preprint archive: physics/0207023.
42. Kullback S., Leibler R.A., Ann. Math. Statist. 22:1951;79-86.
43. S. Kullback, Information Theory and Statistics, Wiley, New York. 1959.
44. T. Cover, J. Thomas, Elements of Information Theory, Wiley, New York, 1991.
45. S.R.S. Varadhan, Large Deviations and Applications, SIAM, Philadelphia, 1984.
46. Wyner A.J., IEEE Trans. Inform. Theory. 43(5):1997;1452-1464.
47. Aldous D., Shields P., Prob. Theory Related Fields. 79:1988;509-542.
48. Jacquet P., Szpankowski W., Tang J., Algorithmica. 31:2001;318-360.
49. A. Crisanti, G. Paladin, A. Vulpiani, Products of Random Matrices in Statistical Physics, Springer, Berlin, 1993.