Share Email Print
cover

Proceedings Paper

Ranking models for combination
Author(s): Thomas M. English
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A considerable amount of research has addressed the methods and objectives of model combination. Very little attention has been given to the question of how to obtain a good collection of models for combination. Here a rationale for inducive inference of multiple models of time series is developed in terms of algorithmic information theory. A model-based Kolmogorov sufficient statistic is described and is utilized in a recursive scheme for ranking models in a population. Ranks are assigned in such a way that the n top-ranked models are considered to be the best subset of n models to use in combination. The ranking scheme is appropriate for use in the selection operation of an evolutionary computation. The treatment is primarily theoretical, but several practical issues in ranking and model combination are addressed.

Paper Details

Date Published: 13 October 2000
PDF: 8 pages
Proc. SPIE 4120, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation III, (13 October 2000); doi: 10.1117/12.403621
Show Author Affiliations
Thomas M. English, The Tom English Project (United States)


Published in SPIE Proceedings Vol. 4120:
Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation III
Bruno Bosacchi; David B. Fogel; James C. Bezdek, Editor(s)

© SPIE. Terms of Use
Back to Top