The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Inference of statistical models and discovery of patterns in random data sets are problems common to many fields of investigation. In particular, in the observation and control of processes where the physical mechanisms are too complex or not well understood to provide a model structure a priori, the choice of model structure and model size becomes a key element in the analysis. This paper describes an unsupervised technique for the ranking and model structures and choice of model size based on the expression [-log likelihood + model size (in bits) 1. This criterion is shown to be equivalent to seeking a parsimonious representation for data, and its derivation is motivated through a Bayesian argument. Limiting properties of the criterion and applications to number of clusters, dimension of a linear predictor, degree of polynomial approximation, or order of a Markov chain are discussed.

Notes

Grant ID: #F33615-86-C-5-38

Text Reference

Jakub Segen and Arthur C. Sanderson, "Model Inference and Pattern Discovery by Minimal Representation Method," tech. report CMU-RI-TR-81-02, Robotics Institute, Carnegie Mellon University, July, 1981

BibTeX Reference

@techreport{Sanderson_1981_32,
   author = "Jakub Segen and Arthur C Sanderson",
   title = "Model Inference and Pattern Discovery by Minimal Representation Method",
   booktitle = "",
   institution = "Robotics Institute",
   month = "July",
   year = "1981",
   number= "CMU-RI-TR-81-02",
   address= "Pittsburgh, PA",
}

The Robotics Institute

Menu