AN ANALYSIS OF THE MAX-MIN APPROACH TO FEATURE-SELECTION AND ORDERING

被引：13

作者：

PUDIL, P ^{[1
]}

NOVOVICOVA, J ^{[1
]}

CHOAKJARERNWANIT, N ^{[1
]}

KITTLER, J ^{[1
]}

机构：

[1] CZECHOSLOVAK ACAD SCI, INST INFORMAT THEORY & AUTOMAT, CS-18208 PRAGUE 8, CZECHOSLOVAKIA

来源：

PATTERN RECOGNITION LETTERS | 1993年 / 14卷 / 11期

关键词：

FEATURE SELECTION; FEATURE ORDERING; MAX-MIN ALGORITHM;

D O I：

10.1016/0167-8655(93)90147-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The causes of deficiency of the Max-Min approach to feature selection are investigated. It is shown that the theoretical premise providing the basis for the Max-Min algorithm is not necessarily valid. A condition under which the Max-Min algorithm is not justified is derived, and a counterexample illustrating it is presented.

引用

页码：841 / 847

页数：7

共 11 条

[1]

BACKER E, 1977, SEMINAR PATTERN RECO

[2]

CHOAKJARERNWANI.N, 1991, VSSPTR591 U SURR TEC

[3]

CHOAKJARERNWANI.N, 1991, VSSPTR191 U SURR TEC

[4] POSSIBLE ORDERINGS IN MEASUREMENT SELECTION PROBLEM [J].

COVER, TM ;

VANCAMPENHOUT, JM .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1977, 7 (09) :657-661

[5]

Devijver PA, 1982, PATTERN RECOGNITION

[6]

HAND DJ, 1981, DISCRIMINATION CLASS, pCH6

[7]

KITTER J, 1978, PATTERN RECOGNITION

[8]

KITTER JA, 1990, PATTERN RECOGN, P81

[9]

KITTLER J, 1986, HDB PATTERN RECOGNIT, P60

[10]

NARENDRA P, 1977, IEEE T COMPUT, V26, P917, DOI 10.1109/TC.1977.1674939

← 1 2 →