论文信息 - Context maximizing : finding MDL decision trees

Context maximizing : finding MDL decision trees

We present an application of the context weighting algorithm. Our objective is to classify objects with decision trees. The best tree will be searched for with the Minimum Description Length Principle. In order to find these trees, we modified the context weighting algorithm.

Fmj Frans Willems | Paj Paul Volf

[1] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..

[2] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.

[3] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..

[4] Frans M. J. Willems,et al. Context weighting for general finite-context sources , 1996, IEEE Trans. Inf. Theory.

[5] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.