-
1
-
-
84926662675
-
Nearest neighbor pattern classification
-
T.M. Cover, and P.E. Hart, "Nearest neighbor pattern classification", IEEE Transaction of Information Theory, Vol. 13, 1967, pp. 21-27.
-
(1967)
IEEE Transaction of Information Theory
, vol.13
, pp. 21-27
-
-
Cover, T.M.1
Hart, P.E.2
-
2
-
-
84931162639
-
The condensed nearest neighbor rule
-
P. Hart, "The condensed nearest neighbor rule", IEEE Trans. on Information Theory, Vol. 14, 1968, pp.515-516.
-
(1968)
IEEE Trans. on Information Theory
, vol.14
, pp. 515-516
-
-
Hart, P.1
-
3
-
-
0028385080
-
Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design
-
B. V. Dasarathy, "Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design", IEEE Trans. on Systems, Man, and Cybernetics, Vol. 24, 1994, pp. 511-517.
-
(1994)
IEEE Trans. on Systems, Man, and Cybernetics
, vol.24
, pp. 511-517
-
-
Dasarathy, B.V.1
-
4
-
-
0028515320
-
Finding a subset of representative points in a data set
-
D. Chaudhuri, C. A. Murthy, and B. B. Chaudhuri, "Finding a subset of representative points in a data set", IEEE Trans. on Systems, Man, and Cybernetics, Vol. 24, 1994, pp. 1416-1424.
-
(1994)
IEEE Trans. on Systems, Man, and Cybernetics
, vol.24
, pp. 1416-1424
-
-
Chaudhuri, D.1
Murthy, C.A.2
Chaudhuri, B.B.3
-
5
-
-
0013384310
-
Genetic algorithm-based instance and feature selection
-
Norwell, MA, Kluwer Academic Publishers
-
H. Ishibuchi, T. Nakashima, and M. Nii, "Genetic algorithm-based instance and feature selection", Instance Selection and Construction for Data Mining, Norwell, MA, Kluwer Academic Publishers, 2001, pp. 95-112.
-
(2001)
Instance Selection and Construction for Data Mining
, pp. 95-112
-
-
Ishibuchi, H.1
Nakashima, T.2
Nii, M.3
-
6
-
-
0024895461
-
A note on genetic algorithms for large-scale feature selection
-
W. Siedlecki, and J. Sklansky, "A note on genetic algorithms for large-scale feature selection", Pattern Recognition Letters, Vol. 10, 1989, pp. 335-347.
-
(1989)
Pattern Recognition Letters
, vol.10
, pp. 335-347
-
-
Siedlecki, W.1
Sklansky, J.2
-
8
-
-
0015361129
-
Asymptotic properties of nearest neighbor rules using edited data
-
D. L. Wilson, "Asymptotic properties of nearest neighbor rules using edited data", IEEE Trans. on Systems, Man, and Cybernetics, Vol. 2, 1972, pp. 408-420.
-
(1972)
IEEE Trans. on Systems, Man, and Cybernetics
, vol.2
, pp. 408-420
-
-
Wilson, D.L.1
-
9
-
-
0000935031
-
Editing for the k-nearest neighbors rule by a genetic algorithm
-
L. I. Kuncheva, "Editing for the k-nearest neighbors rule by a genetic algorithm", Pattern Recognition Letters, Vol. 16, 1995, pp. 809-814.
-
(1995)
Pattern Recognition Letters
, vol.16
, pp. 809-814
-
-
Kuncheva, L.I.1
-
10
-
-
0031168619
-
Fitness functions in editing k-NN reference set by genetic algorithms
-
L. I. Kuncheva, "Fitness functions in editing k-NN reference set by genetic algorithms", Pattern Recognition, Vol. 30, 1997, pp. 1041-1049.
-
(1997)
Pattern Recognition
, vol.30
, pp. 1041-1049
-
-
Kuncheva, L.I.1
-
11
-
-
0003722376
-
-
Reading, MA, Addison-Wesley
-
D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA, Addison-Wesley, 1989.
-
(1989)
Genetic Algorithms in Search, Optimization, and Machine Learning
-
-
Goldberg, D.E.1
-
12
-
-
0003444646
-
-
MIT Press, Cambridge, USA
-
D. E. Rumelhart, J. L. McClelland, and the PDP Research Group, Parallel Distributed Processing, MIT Press, Cambridge, USA, 1986.
-
(1986)
Parallel Distributed Processing
-
-
Rumelhart, D.E.1
McClelland, J.L.2
-
13
-
-
0003932630
-
-
San Matea, CA, Morgan Kaufmann
-
S. M. Weiss, and C. A. Kulikowski, Computer Systems that Learn, San Matea, CA, Morgan Kaufmann, 1991.
-
(1991)
Computer Systems That Learn
-
-
Weiss, S.M.1
Kulikowski, C.A.2
|