### Abstract

The document classification problem has been investigated by various techniques, such as a vector space model, a support vector machine, a random forest, and so on. On the other hand, J. Ziv et al. have proposed a document classification method using Ziv-Lempel algorithm to compress the data. Furthermore, the Context-Tree Weighting (CTW) algorithm has been proposed as an outstanding data compression, and for the document classification using the CTW algorithm experimental results have been reported. In this paper, we assume that each document with same category arises from Markov model with same parameters for the document classification. Then we propose an analysis method to estimate a classification error probability for the document with the finite length.

Original language | English |
---|---|

Title of host publication | 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 |

Pages | 717-721 |

Number of pages | 5 |

Publication status | Published - 2012 |

Event | 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 - Honolulu, HI Duration: 2012 Oct 28 → 2012 Oct 31 |

### Other

Other | 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 |
---|---|

City | Honolulu, HI |

Period | 12/10/28 → 12/10/31 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science Applications
- Information Systems

### Cite this

*2012 International Symposium on Information Theory and Its Applications, ISITA 2012*(pp. 717-721). [6401034]