This work deals with the classification problem in the case that groups are known and both labeled and unlabeled data are available. The classification rule is derived using Gaussian mixtures, with covariance matrices fixed according to a multiple testing procedure, which allows to choose among four alternatives: heteroscedasticity, homometroscedasticity, homotroposcedasticity, and homoscedasticity. The mixture models are then fitted using all available data (labeled and unlabeled) and adopting the EM and the CEM algorithms. Applications on real data are provided in order to show the classification performance of the proposed procedure
This paper examines the relative performance of two commonly used clustering methods based on maximu...
When working with model-based classifications, finite mixture models are utilized to describe the di...
We introduce a method for dimension reduction with clustering, classification, or discriminant analy...
This work deals with the classification problem in the case that groups are known and both labeled a...
This work deals with the classification problem in the case that groups are known and both labeled a...
We consider model-based clustering methods for continuous, correlated data that account for external...
Gaussian Mixture Models (GMMs) are one of the most widespread methodologies for model-based clusteri...
Gaussian Mixture Models (GMMs) are one of the most widespread methodologies for model-based clusteri...
This chapter is dedicated to model-based supervised and unsupervised classification.Probability dist...
International audienceThis chapter is dedicated to model-based supervised and unsupervised classific...
This chapter is dedicated to model-based supervised and unsuper-vised classification. Probability di...
In recent work, robust mixture modelling approaches using skewed distributions have been explored to...
International audienceThis chapter is dedicated to model-based supervised and unsupervised classific...
Print ISBN: 978-1-4577-0044-6International audienceBinning of data in cluster analysis has advantage...
Print ISBN: 978-1-4577-0044-6International audienceBinning of data in cluster analysis has advantage...
This paper examines the relative performance of two commonly used clustering methods based on maximu...
When working with model-based classifications, finite mixture models are utilized to describe the di...
We introduce a method for dimension reduction with clustering, classification, or discriminant analy...
This work deals with the classification problem in the case that groups are known and both labeled a...
This work deals with the classification problem in the case that groups are known and both labeled a...
We consider model-based clustering methods for continuous, correlated data that account for external...
Gaussian Mixture Models (GMMs) are one of the most widespread methodologies for model-based clusteri...
Gaussian Mixture Models (GMMs) are one of the most widespread methodologies for model-based clusteri...
This chapter is dedicated to model-based supervised and unsupervised classification.Probability dist...
International audienceThis chapter is dedicated to model-based supervised and unsupervised classific...
This chapter is dedicated to model-based supervised and unsuper-vised classification. Probability di...
In recent work, robust mixture modelling approaches using skewed distributions have been explored to...
International audienceThis chapter is dedicated to model-based supervised and unsupervised classific...
Print ISBN: 978-1-4577-0044-6International audienceBinning of data in cluster analysis has advantage...
Print ISBN: 978-1-4577-0044-6International audienceBinning of data in cluster analysis has advantage...
This paper examines the relative performance of two commonly used clustering methods based on maximu...
When working with model-based classifications, finite mixture models are utilized to describe the di...
We introduce a method for dimension reduction with clustering, classification, or discriminant analy...