Finding outpoints in noisy binary sequences- a revised empirical evaluation

13Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Viswanathan, M., Wallace, C. S., Dowe, D. L., & Korb, K. B. (1999). Finding outpoints in noisy binary sequences- a revised empirical evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1747, pp. 405–416). Springer Verlag. https://doi.org/10.1007/3-540-46695-9_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free