Paper
13 October 2000 Ranking models for combination
Thomas M. English
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas M. English "Ranking models for combination", Proc. SPIE 4120, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation III, (13 October 2000); https://doi.org/10.1117/12.403621
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

Statistical modeling

Model-based design

Information theory

Error analysis

Binary data

Algorithm development

RELATED CONTENT


Back to Top