Abstract
Kearns et al. (1997) in an earlier paper presented an empirical evaluation of model selection methods on a specialized version of the segmentation problem. The inference task was the estimation of a predefined Boolean function on the real interval [0,1] from a noisy random sample. Three model selection methods based on the Guaranteed Risk Minimization, Minimum Description Length (MDL) Principle and Cross Validation were evaluated on samples with varying noise levels. The authors concluded that, in general, none of the methods was superior to the others in terms of predictive accuracy. In this paper we identify an inefficiency in the MDL approach as implemented by Kearns et al. and present an extended empirical evaluation by including a revised version of the MDL method and another approach based on the Minimum Message Length (MML) principle.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kearns, M., Mansour, Y., Ng, A. Y., Ron, D., “An Experimental and Theoretical Comparison of Model Selection Methods”, Machine Learning, 27, 7–50, 1997.
Wallace, C.S. and Boulton, D. M., “An information measure for classification”, Computer Journal, 2:11, 195–209, 1968.
Wallace, C.S. and Freeman, P.R., “Estimation and Inference by Compact Coding”, Journal of the Royal Statistical Society, B,49: 240–252, 1987.
Rissanen, J., “Stochastic Complexity and Modeling”, Annals of Statistics, 14, 1080–1100, 1986.
Vapnik, V., Statistical Learning Theory, Springer, New York, 1995.
Viswanathan, M. and Wallace, C. S., “A Note on the Comparison of Polynomial Selection Methods”, in Artificial Intelligence and Statistics 99, Morgan Kaufmann, 169–177, 1999.
Wallace, C. S. and Dowe, D. L., “Minimum Message Length and Kolmogorov Complexity”, to appear, Computer Journal.
Stone, M., “Cross-validatory Choice and Assessment of Statistical Predictions”, Journal of the Royal Statistical Society, B,36, 111–147, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viswanathan, M., Wallace, C.S., Dowe, D.L., Korb, K.B. (1999). Finding Outpoints in Noisy Binary Sequences — A Revised Empirical Evaluation. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive