Variational approaches to density estimation and pattern recognition using Gaussian mixture models can be used to learn the model and optimize its complexity simultaneously. In this brief, we develop an incremental entropy-based variational learning scheme that does not require any kind of initialization. The key element of the proposal is to exploit the incremental learning approach to perform model selection through efficient iteration over the variational Bayes optimization step in a way that the number of splits is minimized. The method starts with just one component and adds new components iteratively by splitting the worst fitted kernel in terms of evaluating its entropy. Our experimental results, on synthetic and real data sets show the effectiveness of the approach outperforming other state-of-the-art incremental component learners.
18 September 2009 in IEEE Transactions on Neural Networks
In this paper, we address the problem of estimating the parameters of Gaussian mixture models. Although the expectation-maximization (EM) algorithm yields the maximum-likelihood (ML) solution, its sensitivity to the selection of the starting parameters is well-known and it may converge to the boundary of the parameter space. Furthermore, the resulting mixture depends on the number of selected components, but the optimal number of kernels may be unknown beforehand. We introduce the use of the entropy of the probability density function (pdf) associated to each kernel to measure the quality of a given mixture model with a fixed number of kernels. We propose two methods to approximate the entropy of each kernel and a modification of the classical EM algorithm in order to find the optimum number of components of the mixture. Moreover, we use two stopping criteria: a novel global mixture entropy-based criterion called Gaussianity deficiency (GD) and a minimum description length (MDL) principle-based one. Our algorithm, called entropy-based EM (EBEM), starts with a unique kernel and performs only splitting by selecting the worst kernel attending to GD. We have successfully tested it in probability density estimation, pattern classification, and color image segmentation. Experimental results improve the ones of other state-of-the-art model order selection methods.
Usability inspections are a set of methods for evaluating one interactive system by experts. They try to find possible usability problems and determining the level of usability of the system without involving real users. One of these methods is heuristic evaluation, where several experts inspect one system or its interface for searching usability issues. Some authors maintain that evaluation by experts in usability discovers more usability issues than evaluation conducted by non-experts. But the question is how to determine the degree of expertise of an evaluator. In this paper we will propose a classification of evaluators based on the university degree obtained or the number of hours of practice gathered in this field. One user could be classified as expert depending on his/her professional career and not only by university degrees. This is why it is important to collect other attributes of each user like domains, skills or projects to determine their expertise. We finally present how to validate these attributes by other users of the proposed repository.