This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Approximate Solution to Normal Mixture Identification with Application to Unsupervised Pattern Classification
February 1981 (vol. 3 no. 2)
pp. 163-179
Jack-Gerard Postaire, MEMBER, IEEE, Laboratoire d'Electronique et d'Etude des Systemes Automatiques, Faculté des Sciences, Rabat, Morocco.
Christian P. A. Vasseur, Centre d'Automatique, Université de Lille, Villeneuve d'Ascq, Cedex, France.
In this paper, an approach to unsupervised pattern classifiation is discussed. The classification scheme is based on an approximation of the probability densities of each class under the assumption that the input patterns are of a normal mixture. The proposed technique for identifying the mixture does not require prior information. The description of the mixture in terms of convexity allows to determine, from a totally unlabeled set of samples, the number of components and, for each of them, approximate values of the mean vector, the covariance matrix, and the a priori probability. Discriminant functions can then be constructed. Computer simulations show that the procedure yields decision rules whose performances remain close to the optimum Bayes minimum error-rate, while involving only a small amount of computation.
Citation:
Jack-Gerard Postaire, Christian P. A. Vasseur, "An Approximate Solution to Normal Mixture Identification with Application to Unsupervised Pattern Classification," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 2, pp. 163-179, Feb. 1981, doi:10.1109/TPAMI.1981.4767074
Usage of this product signifies your acceptance of the Terms of Use.