Finding outpoints in noisy binary sequences- a revised empirical evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1747, Issue , 1999, Pages 405-416

  Viswanathan, Murlikrishna ^a   Wallace, Chris S ^a   Dowe, David L ^a   Korb, Kevin B ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS;

CROSS VALIDATION; EMPIRICAL EVALUATIONS; MINIMUM DESCRIPTION LENGTH PRINCIPLE; MINIMUM MESSAGE LENGTHS; MODEL SELECTION METHODS; PREDICTIVE ACCURACY; REAL INTERVALS; RISK MINIMIZATION;

BINARY SEQUENCES;

EID: 84957662553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46695-9_34     Document Type: Conference Paper

References (8)

1. Kearns, M., Mansour, Y., Ng, A. Y., Ron, D., “An Experimental and Theoretical Comparison of Model Selection Methods”, Machine Learning, 27, 7-50, 1997.
2. Wallace, C.S. and Boulton, D. M., “An information measure for classification”, Computer Journal, 2:11, 195-209, 1968.
3. Wallace, C.S. and Freeman, P.R., “Estimation and Inference by Compact Coding”, Journal of the Royal Statistical Society, B, 49: 240-252, 1987.
4. Rissanen, J., “Stochastic Complexity and Modeling”,Annals of Statistics, 14, 1080-1100, 1986.
5. Vapnik, V., Statistical Learning Theory, Springer, New York, 1995.
6. 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.
7. Wallace, C. S. and Dowe, D. L., “Minimum Message Length and Kolmogorov Complexity”, to appear, Computer Journal.
8. Stone, M., “Cross-validatory Choice and Assessment of Statistical Predictions”, Journal of the Royal Statistical Society, B, 36, 111-147, 1974.