Implementing the context tree weighting method for content recognition

Data Compression Conference Proceedings

Volumn , Issue , 2004, Pages 536-

  Dawy, Zaher ^a   Hagenauer, Joachim ^a   Hoffmann, Andreas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DNA; PATTERN RECOGNITION; PROBLEM SOLVING; SET THEORY;

AUTHORSHIP ATTRIBUTION; CONTENT RECOGNITION; CONTEXT TREE WEIGHTING METHOD (CTW); LANGUAGE RECOGNITION;

DATA COMPRESSION;

EID: 2642550954     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. F. M. J- Willems, Y. M. Shtarkov, and T. J. Tjalkens, "The contect tree weighting method: Basic properties," IEEE Trans. Info. Theory, vol. 41, pp. 653-664, May 1995.
2. K. Sadakane, T. Okazaki, and H. Imai, "Implementing the context tree weighting method for text compression," in IEEE Data Compression Conference, (Snowbird, Utah, USA), March 2000.
3. W. I. Teahan, S. Inglis, J. G. Cleary, and G. Holmes, "Correcting english text using PPM models," in IEEE Data Compression Conference, (Snowbird, Utah, USA), March 1998.
4. D. Bencdetto, E. Caglioti, and V. Loreto, "Language trees and zipping," Physical Review Letters, vol. 88, January 2002.
5. A. Puglisi, D. Benedetto, E. Caglioti, V. Loreto, and A. Vulpiani, "Data compression and learning in time sequence analysis," Physica D, vol. 180, pp. 92-107, January 2003.
6. Institute for Communications Engineering, Munich University of Technology, http://www.Int.ei.tum.de.