The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1975 vol.24)
pp: 908-915
W.L.G. Koontz , Bell Laboratories
ABSTRACT
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, September 1975, doi:10.1109/T-C.1975.224336
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool