An MDL estimate of the significance of rules
暂无分享,去创建一个
[1] 金田 重郎,et al. C4.5: Programs for Machine Learning (書評) , 1995 .
[2] Ian H. Witten,et al. A comparison of enumerative and adaptive codes , 1984, IEEE Trans. Inf. Theory.
[3] Brian R. Gaines,et al. The Trade-Off between Knowledge and Data in Knowledge Acquisition , 1991, Knowledge Discovery in Databases.
[4] Ashwin Srinivasan,et al. Distinguishing Exceptions From Noise in Non-Monotonic Learning , 1992 .
[5] Robert J. McQueen,et al. Applying machine learning to agricultural data , 1995 .
[6] Ian H. Witten,et al. Complexity-based induction , 2004, Machine Learning.
[7] Ian H. Witten,et al. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression , 1991, IEEE Trans. Inf. Theory.
[8] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[9] Ian H. Witten,et al. Text Compression , 1990, 125 Problems in Text Algorithms.
[10] Ian H. Witten,et al. Machine learning in practice: experience with agricultural databases , 1995 .
[11] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..
[12] Ashwin Srinivasan,et al. Compression, Significance, and Accuracy , 1992, ML.
[13] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[14] Jorma Rissanen,et al. Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.