A Branch and Bound Clustering Algorithm

IEEE Transactions on Computers

Volumn C-24, Issue 9, 1975, Pages 908-915

  Narendra, Patrenahalli M ^b   Fukunaga, Keinosuke ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Branch and bound; clustering; combinatorial; optimization; pattern recognition

Indexed keywords

PATTERN RECOGNITION SYSTEMS;

EID: 0016557353     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1975.224336     Document Type: Article

References (8)

1. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symp., vol. I, 1966, pp. 281-297.
2. G. H. Ball and D. J. Hall, “ISODATA-A novel method of data analysis and pattern classification,” Stanford Res. Institute, Menlo Park, Calif., Tech. Rep., SRI Project 5533, May 1973.
3. J. J. Fortier and H. Solomon, Clustering Procedures in Mulivariate Analysis, P. R. Krishnaiah, Ed. New York: Academic, 1966, pp. 493-506.
4. S. W. Golomb and L. D. Baumert, “Backtrack programming,” J. Ass. Comput. Mach., vol. 12, pp. 516-524, Jan. 1965.
5. A. L. Chernyavskii, “Algorithms for the solution of combinatorial problems based on a method of implicit enumeration,” Automat. Remote Contr., vol. 33, pp. 252-260, Feb. 1972.
6. E. L. Lawler and D. E. Wood, “Branch-and-bound methods a survey,” Oper. Res., vol. 149, 1966.
7. N. J. Nilsson, Problem Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971, ch. 3.
8. J. D. Swift, “Isomorph rejection in exhaustive search techniques,” in Proc. Amer. Math. Soc. Symp. Appl. Math., vol. 10, 1960, pp. 195-200.