Comparison of instance selection algorithms II. results and comments

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3070, Issue , 2004, Pages 580-585

  Grochowski, Marek ^a   Jankowski, Norbert ^a  

^a NICOLAUS COPERNICUS UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; LEARNING SYSTEMS; NEURAL NETWORKS; STANDARDIZATION; TREES (MATHEMATICS); TUMORS;

BREAST CANCER; DATA SETS; DECISION TREES (DT); INSTANCE SELECTION;

ALGORITHMS;

EID: 9444268167     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24844-6_87     Document Type: Conference Paper

References (15)

1. Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man, and Cybernetics 2 (1972) 408-421
2. Grochowski, M.: Wybór wektorów referencyjnych dla wybranych method klasyfikacji. Master's thesis, Department of Informatics, Nicholas Copernicus University, Poland (2003)
3. Jankowski, N.: Data regularization. In Rutkowski, L., Tadeusiewicz, R., eds.: Neural Networks and Soft Computing, Zakopane, Poland (2000) 209-214
4. Hart, P.E.: The condensed nearest neighbor rule. IEEE Transactions on Information Theory 14 (1968) 515-516
5. Chang, C.L.: Finding prototypes for nearest neighbor classifiers. IEEE Transactions on Computers 23 (1974) 1179-1184
6. Gates, G.: The reduced nearest neighbor rule. IEEE Transactions on Information Theory 18 (1972) 431-433
7. Aha, D.W., Kibler, D., Albert, M.K.: Aha,. Machine Learning 6 (1991) 37-66
8. Bhattacharya, B.K., Poulsen, R.S., Toussaint, G.T.: Application of proximity graphs to editing nearest neighbor decision rule. In: International Symposium on Information Theory, Santa Monica (1981)
9. Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery 6 (2002) 153-172
10. Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Machine Learning 38 (2000) 257-286
11. Kohonen, T.: Learning vector quantization for pattern recognition. Technical Report TKK-F-A601, Helsinki University of Technology, Espoo, Finland (1986)
12. Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: International Conference on Machine Learning. (1994) 293-301
13. Cameron-Jones, R.M.: Instance selection by encoding length heuristic with random mutation hill climbing. In: Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence. (1995) 99-106
14. Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases (1998) http://www.ics.uci.edu/~mlearn/MLRepository.html.
15. Hippe, Z.S., Iwaszek, G.: From research on a new method of development of quasi-optimal decision trees. In Kopotek, M., Michalewicz, M., Wierzcho, S.T., eds.: Intelligent Information Systems IX, Warszawa, Institute of computer science (2000) 31-35