Pattern recognition as a quest for minimum entropy

DOI10.1016/0031-3203(81)90094-7MaRDI QIDQ1152921zbMATH OpenOpenAlexFDO

Authors Satosi Watanabe

Publication date 1981

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(81)90094-7

zbMATH Keywords

algorithmsclusteringlearning theorypattern recognitionminimum entropyKarhunen-Loeve expansioncoalescence modelFisher discriminantDiday-Lemoine criterion

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cites work

• scientific article; zbMATH DE number 3746462 (Why is no real title available?)
• scientific article; zbMATH DE number 3222514 (Why is no real title available?)
• scientific article; zbMATH DE number 3327941 (Why is no real title available?)
• Learning process and inverse H-theorem
• ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
• Scene Labeling by Relaxation Operations

Cited in

(13)

• Optimal attribute sets for identifications and diagnoses
• Where do we stand on measures of uncertainty, ambiguity, fuzziness, and the like?
• Dictionary Learning Algorithms for Sparse Representation
• The use of entropy minimization for the solution of blind source separation problems in image analysis
• Playing games with bounded entropy
• The MEE principle in data classification: a perceptron-based analysis
• On the entropy of couplings
• On Different Facets of Regularization Theory
• Optimal network compression
• Disaggregated total uncertainty measure for credal sets
• Measures of discord in the Dempster-Shafer theory
• Conditional clusters, musters, and probability
• MEASURES OF UNCERTAINTY AND INFORMATION BASED ON POSSIBILITY DISTRIBUTIONS

This page was built for publication: Pattern recognition as a quest for minimum entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152921)