A Branch and Bound Algorithm for Feature Subset Selection

IEEE Transactions on Computers

Volumn C-26, Issue 9, 1977, Pages 917-922

  Narendra, Patrenahalli M ^a   Fukunaga, Keinosuke ^b  

^a HONEYWELL TECHNOLOGY CENTER   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Branch and bound; combinatorial optimization; feature selection; recursive computation

Indexed keywords

FEATURE SELECTION;

PATTERN RECOGNITION SYSTEMS;

EID: 0017535866     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1977.1674939     Document Type: Article

References (8)

1. A. N. Mucciardi and E. E. Gose, “A comparison of seven techniques for choosing subsets of pattern recognition properties,” IEEE Trans. Comput., vol. C-20, pp. 1023–1031, Sept. 1971.
2. C. Y. Chang, “Dynamic programming as applied to feature subset selection in a pattern recognition system,” IEEE Trans. Syst. Man Cybern., vol. SMC-3, pp. 166–171, Mar. 1973.
3. S. W. Golomb and L. D. Baumert, “Backtrack programming,” J. Ass. Comput. Mach., vol. 12, pp. 516–523, Jan. 1965.
4. E. L. Lawler and D. E. Wood, “Branch-and-bound methods—A survey,” Oper. Res., vol. 149, no. 4, 1966.
5. W. L. G. Koontz, P. M. Narendra, and K. Fukunaga, “A branch and bound clustering algorithm,” IEEE Trans. Comput., pp. 908–915, Sept. 1975.
6. K. Fukunaga and P. M. Narendra, “A branch and bound algorithm for computing k-nearest neighbors,” IEEE Trans. Comput., vol. C-24, pp. 750–753, July 1975.
7. C. R. Rao, Linear Statistical Inference and Its Applications. New York Wiley, 1965, p. 29.
8. K. Fukunaga, Introduction to Statistical Pattern Recognition. New York: Academic, 1972, ch. 9.