EVALUATION OF THE BRANCH AND BOUND ALGORITHM FOR FEATURE-SELECTION

被引：11

作者：

HAMAMOTO, Y ^{[1
]}

UCHIMURA, S ^{[1
]}

MATSUURA, Y ^{[1
]}

KANAOKA, T ^{[1
]}

TOMITA, S ^{[1
]}

机构：

[1] OSHIMA NATL COLL MARITIME TECHNOL, OSHIMA 74221, JAPAN

来源：

PATTERN RECOGNITION LETTERS | 1990年 / 11卷 / 07期

关键词：

bound algorithm; branch; exhaustive search algorithm; Feature selection; recognition rate;

D O I：

10.1016/0167-8655(90)90078-G

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Narendra and Fukunaga show that the branch and bound algorithm guarantees the optimal feature subset without evaluating all possible feature subsets, if the criterion function used satisfies the 'monotonicity' property. In this paper, we show that the algorithm works well in terms of the recognition rate, even if the property is not satisfied. © 1990.

引用

页码：453 / 456

页数：4

共 8 条

[1] USE OF FACES TO REPRESENT POINTS IN K-DIMENSIONAL SPACE GRAPHICALLY
CHERNOFF, H
[J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1973, 68 (342) : 361 - 368
[2] POSSIBLE ORDERINGS IN MEASUREMENT SELECTION PROBLEM
COVER, TM
VANCAMPENHOUT, JM
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1977, 7 (09): : 657 - 661
[3] The use of multiple measurements in taxonomic problems
Fisher, RA
[J]. ANNALS OF EUGENICS, 1936, 7 : 179 - 188
[4] FEATURE-SELECTION FOR AUTOMATIC CLASSIFICATION OF NON-GAUSSIAN DATA
FOROUTAN, I
SKLANSKY, J
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1987, 17 (02): : 187 - 198
[5] FEATURE SELECTION IN PATTERN RECOGNITION
FU, KS
MIN, PJ
LI, TJ
[J]. IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1970, SSC6 (01): : 33 - &
[6] ON MEAN ACCURACY OF STATISTICAL PATTERN RECOGNIZERS
HUGHES, GF
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (01) : 55 - +
[7] ON EFFECTIVENESS OF RECEPTORS IN RECOGNITION SYSTEMS
MARILL, T
GREEN, DM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1963, 9 (01) : 11 - &
[8] NARENDRA P, 1977, IEEE T COMPUT, V26, P917, DOI 10.1109/TC.1977.1674939

← 1 →