Providing efficient yet accurate statistical models is a challenging problem in many applications. When elementary models are not sufficiently descriptive, mixtures of densities can be used. A complexity management issue arises when mixture models are employed: the number of components should be a trade-off between the complexity and the accuracy of the model. However, in general, it is not obvious how to determine the right number of mixture components for a specific application. In a previous work, theoretical foundations to address such a topic have been laid, grounded on the use of the Composite Transportation Dissimilarity between mixtures, and a preliminary criterion to manage the complexity of a mixture model has been proposed. In this paper, additional theoretical insights are provided that allow to formulate a novel adaptive mixture reduction algorithm. Numerical tests show that in most cases the new algorithm constitutes a significant improvement over the previous one.

Adaptive Mixture Model Reduction based on the Composite Transportation Dissimilarity

D'Ortenzio A.;Manes C.;De Iuliis V.;
2023-01-01

Abstract

Providing efficient yet accurate statistical models is a challenging problem in many applications. When elementary models are not sufficiently descriptive, mixtures of densities can be used. A complexity management issue arises when mixture models are employed: the number of components should be a trade-off between the complexity and the accuracy of the model. However, in general, it is not obvious how to determine the right number of mixture components for a specific application. In a previous work, theoretical foundations to address such a topic have been laid, grounded on the use of the Composite Transportation Dissimilarity between mixtures, and a preliminary criterion to manage the complexity of a mixture model has been proposed. In this paper, additional theoretical insights are provided that allow to formulate a novel adaptive mixture reduction algorithm. Numerical tests show that in most cases the new algorithm constitutes a significant improvement over the previous one.
2023
979-8-89034-485-4
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/221780
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact