OPTIMUM FEATURE-SELECTION BY ZERO-ONE INTEGER PROGRAMMING

被引：24

作者：

ICHINO, M ^{[1
]}

SKLANSKY, J ^{[1
]}

机构：

[1] UNIV CALIF IRVINE,SCH ENGN,IRVINE,CA 92717

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1984年 / 14卷 / 05期

关键词：

D O I：

10.1109/TSMC.1984.6313294

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：737 / 746

页数：10

共 17 条

BALAS, E .

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

COVER, TM ;

VANCAMPENHOUT, JM .

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

[3]

FRIEDMAN JH, 1977, IEEE T COMPUT, V26, P404, DOI 10.1109/TC.1977.1674849

[4] RECENT DEVELOPMENTS IN PATTERN-RECOGNITION [J].

FU, KS .

[5] INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS METHOD [J].

GEOFFRION, AM .

[6] CONDENSED NEAREST NEIGHBOR RULE [J].

HART, PE .

[7]

Ichino M., 1979, IEEE Transactions on Systems, Man and Cybernetics, VSMC-9, P345, DOI 10.1109/TSMC.1979.4310223

[8]

KANAL L, 1974, IEEE T INFORM THEORY, V20

[9]

KILKARNI AV, 1976, 3RD P INT JOINT C PA, P459

[10]

Kittler J., 1978, PATTERN RECOGNITION