Pattern recognition as a quest for minimum entropy

DOI10.1016/0031-3203(81)90094-7zbMath0462.62045OpenAlexW2073237809MaRDI QIDQ1152921

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

algorithmspattern recognitionclusteringlearning theoryminimum entropyKarhunen-Loeve expansioncoalescence modelFisher discriminantDiday-Lemoine criterion

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scene Labeling by Relaxation Operations
• ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
• Learning process and inverse H-theorem

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