The Community for Technology Leaders
Green Image
Issue No. 09 - September (1975 vol. 24)
ISSN: 0018-9340
pp: 908-915
W.L.G. Koontz , Bell Laboratories
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
Branch and bound, clustering, combinatorial optimization, pattern recognition.

K. Fukunaga, P. Narendra and W. Koontz, "A Branch and Bound Clustering Algorithm," in IEEE Transactions on Computers, vol. 24, no. , pp. 908-915, 1975.
94 ms
(Ver 3.3 (11022016))