This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Experimental Study of Some Algorithms for Unsupervised Learning
April 1982 (vol. 4 no. 4)
pp. 400-405
H. Niemann, Lehrstuhl für Informatik 5, Universität Erlangen, Erlangen, West Germany.
G. Sagerer, Lehrstuhl für Informatik 5, Universität Erlangen, Erlangen, West Germany.
Three well-known algorithms for unsupervised learning using a decision-directed approach are the random labeling of patterns according to the estimated a posteriori probabilities, the classification according to the estimated a posteriori probabilities, and the iterative solution of the maximum likelihood equations. The convergence properties of these algorithms are studied by using a sample of about 10 000 handwritten numerals. It turns out that the iterative solution of the maximum likelihood equations has the best properties among the three approaches. However, even this one fails to yield satisfactory results if the number of unknown parameters becomes large, as is usually the case in realistic problems of pattern recognition.
Citation:
H. Niemann, G. Sagerer, "An Experimental Study of Some Algorithms for Unsupervised Learning," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, no. 4, pp. 400-405, April 1982, doi:10.1109/TPAMI.1982.4767271
Usage of this product signifies your acceptance of the Terms of Use.