Nearest neighbour editing and condensing tools-synergy exploitation

被引:62
作者
Dasarathy, BV
Sánchez, JS
Townsend, S
机构
[1] Dynet Inc, Huntsville, AL 35814 USA
[2] Univ Jaume 1, Dept Informat, Castello, Spain
关键词
editing and condensing tools; nearest neighbour; synergy exploitation;
D O I
10.1007/s100440050003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
The objective of this study has been to explore and exploit the synergy among the Nearest Neighbour (NN) editing and condensing tools previously reported in the literature in order to facilitate the use of NN techniques in near real-time applications. The extraordinary progress in the computer field has made NN techniques, once considered impractical from a computational viewpoint, feasible for consideration in rime-constrained, real-world applications. This study accordingly addresses the issue of minimising the computational resource requirements of NN techniques, memory as well as time, through the: use of prototype reduction techniques such as Minimal Consistent Sec (;MCS) selection while preserving the performance quality through suitable editing techniques, such as Proximity Graphs (PG). The tools employed in this investigation are first described briefly. Results of experiments conducted on well known data sets in the literature with various combinations of editing and condensing tools are then presented and discussed to assess the benefits of synergy among these tools. These results demonstrate the: potential benefits of such synergy, and highlight the desirability of a more thorough exploration of combinations of other alternative editing and condensing tools that have been reported in the literature over the past few decades.
引用
收藏
页码:19 / 30
页数:12
相关论文
共 18 条
[1]
ALINAT P, 1993, 4 ROARS ESPRIT
[2]
[Anonymous], 1990, NEAREST NEIGHBOR NN
[3]
ON THE PERFORMANCE OF EDITED NEAREST NEIGHBOR RULES IN HIGH DIMENSIONS [J].
BRODER, AZ ;
BRUCKSTEIN, AM ;
KOPLOWITZ, J .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (01) :136-139
[4]
NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[5]
MINIMAL CONSISTENT SET (MCS) IDENTIFICATION FOR OPTIMAL NEAREST-NEIGHBOR DECISION SYSTEMS-DESIGN [J].
DASARATHY, BV .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (03) :511-517
[6]
NEAREST UNLIKE NEIGHBOR (NUN) - AN AID TO DECISION CONFIDENCE ESTIMATION [J].
DASARATHY, BV .
OPTICAL ENGINEERING, 1995, 34 (09) :2785-2792
[7]
Devijver P., 1982, PATTERN RECOGN
[8]
NONPARAMETRIC DATA REDUCTION [J].
FUKUNAGA, K ;
MANTOCK, JM .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (01) :115-118
[9]
CONDENSED NEAREST NEIGHBOR RULE USING THE CONCEPT OF MUTUAL NEAREST NEIGHBORHOOD [J].
GOWDA, KC ;
KRISHNA, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (04) :488-490
[10]
CONDENSED NEAREST NEIGHBOR RULE [J].
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) :515-+