On coarse graining of information and its application to pattern recognition

DOI10.1063/1.4906011MaRDI QIDQ5066367zbMATH OpenOpenAlexFDO

Authors Ali Ghaderi

Publication date 29 March 2022

Published in AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.3169

Mathematics Subject Classification ID

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

Abstract: We propose a method based on finite mixture models for classifying a set of observations into number of different categories. In order to demonstrate the method, we show how the component densities for the mixture model can be derived by using the maximum entropy method in conjunction with conservation of Pythagorean means. Several examples of distributions belonging to the Pythagorean family are derived. A discussion on estimation of model parameters and the number of categories is also given.

Recommendations

• scientific article; zbMATH DE number 1375608
• Entropy-type classification maximum likelihood algorithms for mixture models
• scientific article; zbMATH DE number 802696
• scientific article; zbMATH DE number 3986452
• scientific article; zbMATH DE number 3874655

Cited in

(3)

• Maximum entropy Gibbs density modeling for pattern classification
• On Tsallis extropy with an application to pattern recognition
• scientific article; zbMATH DE number 4104406 (Why is no real title available?)

This page was built for publication: On coarse graining of information and its application to pattern recognition

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