This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1975 (vol. 24 no. 9)
pp. 908-915
The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization. This algorithm determines the globally optimum classification and is computationally efficient
Index Terms:
Branch and bound, clustering, combinatorial optimization, pattern recognition.
Citation:
W.L.G. Koontz, P.M. Narendra, K. Fukunaga, "A Branch and Bound Clustering Algorithm," IEEE Transactions on Computers, vol. 24, no. 9, pp. 908-915, Sept. 1975, doi:10.1109/T-C.1975.224336
Usage of this product signifies your acceptance of the Terms of Use.