Combining PPM models using a text mining approach

Data Compression Conference Proceedings

Volumn , Issue , 2001, Pages 153-162

  Teahan, W J ^a   Harper, D J ^a  

^a ROBERT GORDON UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DECODING; DYNAMIC PROGRAMMING; SIGNAL ENCODING; TEXT PROCESSING;

LOSSLESS COMPRESSION METHOD; TEXT MINING; VITERBI ALGORITHM;

DATA COMPRESSION;

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

References (22)

1. Sequential coding algorithms: A survey and cost analysis
2. Unbounded length contexts for PPM
3. An open interface for probabilistic models of text
4. Data compression using adaptive coding and partial string matching
5. Unbounded length contexts for PPM
6. The design and analysis of efficient lossless data compression systems
7. Implementing the PPM data compression scheme
8. A mathematical theory of communication
9. An improved interface for probabilistic models of text
10. Text classification and segmentation using minimum cross-entropy
11. Correcting english text using PPM models
12. Switching between two universal source coding algorithms
13. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm
14. The context-tree weighting method: Basic properties
15. Text mining: A new frontier for lossless compression
16. On tag insertion and its complexity
17. Using compression to identify acronyms in text
18. A universal algorithm for sequential data compression