Classification is one of the frequently demanded tasks in data analysis. There exists a series of approaches in this area. This paper is oriented towards classification using the mixture model estimation, which is based on detection of density clusters in the data space and fitting the component models to them. A chosen function of proximity of the actually measured data to individual mixture components and the component shape play a significant role in solving the mixture-based classification task. This paper considers definitions of the proximity for several types of distributions describing the mixture components and compares their properties with respect to speed and quality of the resulting estimation interpreted as a classification task. Normal, exponential and uniform distributions as the most important models used for describing both Gaussian and non-Gaussian data are considered. Illustrative experiments with results of the comparison are provided.
Comparison of Various Definitions of Proximity in Mixture Estimation
I. Nagy,E. Suzdaleva,Pavla Pecherková
Published 2016 in International Conference on Informatics in Control, Automation and Robotics
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
International Conference on Informatics in Control, Automation and Robotics
- Publication date
2016-07-29
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-28 of 28 references · Page 1 of 1
CITED BY
Showing 1-14 of 14 citing papers · Page 1 of 1