An Information Measure for Classification

DOI10.1093/COMJNL/11.2.185zbMath0164.46208OpenAlexW2110381504MaRDI QIDQ5549418

D. M. Boulton, Chris Wallace

Publication date: 1968

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/11.2.185

zbMATH Keywords

numerical analysis

Related Items (45)

Minimum message length analysis of multiple short time series ⋮ Suboptimal behavior of Bayes and MDL in classification under misspecification ⋮ Invariant Bayesian estimation on manifolds ⋮ The discovery of algorithmic probability ⋮ Inferring decision trees using the minimum description length principle ⋮ Open problems in universal induction \& intelligence ⋮ Classification of binary vectors by stochastic complexity. ⋮ Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection ⋮ Competitive On-line Statistics ⋮ Locally uniform prior distributions ⋮ Numerical taxonomy and the principle of maximum entropy ⋮ Averaging over decision trees ⋮ Modeling by shortest data description ⋮ Mathematical issues in the inference of causal interactions among multichannel neural signals ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ The generalized universal law of generalization. ⋮ SMLSOM: the shrinking maximum likelihood self-organizing map ⋮ Algorithmic Statistics: Forty Years Later ⋮ Minimum message length encoding and the comparison of macromolecules ⋮ Extreme deconvolution: inferring complete distribution functions from noisy, heterogeneous and incomplete observations ⋮ Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series ⋮ Simplicity and likelihood: an axiomatic approach ⋮ Rank Selection in Nonnegative Matrix Factorization using Minimum Description Length ⋮ Automatic identification of rock fracture sets using finite mixture models ⋮ Model selection based on minimum description length ⋮ Consistency of discrete Bayesian learning ⋮ Minimum message length estimation using EM methods: a case study ⋮ Explanatory and creative alternatives to the MDL principle ⋮ Predictability, Complexity, and Learning ⋮ Machine learning problems from optimization perspective ⋮ Accumulative prediction error and the selection of time series models ⋮ Model selection by normalized maximum likelihood ⋮ Stochastic motion and the level set method in computer vision: stochastic active contours ⋮ Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions ⋮ Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions ⋮ Prequential analysis of complex data with adaptive model reselection ⋮ Minimum message length shrinkage estimation ⋮ A beam search algorithm for PFSA inference ⋮ The calculi of emergence: Computation, dynamics and induction ⋮ Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings ⋮ Minimum description length revisited ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Joint maximization of accuracy and information for learning the structure of a Bayesian network classifier ⋮ Applying MDL to learn best model granularity ⋮ Flat Minima

This page was built for publication: An Information Measure for Classification