Comparison of instances seletion algorithms I. algorithms survey

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

Volumn 3070, Issue , 2004, Pages 598-603

  Jankowski, Norbert ^a   Grochowski, Marek ^a  

^a NICOLAUS COPERNICUS UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; DATABASE SYSTEMS; GRAPH THEORY; LEARNING SYSTEMS; MONTE CARLO METHODS; NEURAL NETWORKS; SET THEORY;

ALGORITHM SURVEY; CLASSIFICATION ALGORITHMS; DATASETS; MONTE CARLO SAMPLING;

VECTORS;

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

References (20)

1. Duda, R.O., Hart, P.E., Stork, D.G.: Patter Classification and Scene Analysis. 2 edn. Wiley (1997)
2. Aha, D.W., Kibler, D., Albert, M.K.: Aha,. Machine Learning 6 (1991) 37-66
3. Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. Institute of Electrical and Electronics Engineers Transactions on Information Theory 13 (1967) 21-27
4. Hart, P.E.: The condensed nearest neighbor rule. IEEE Transactions on Information Theory 14 (1968) 515-516
5. Ritter, G.L., Woodruff, H.B., Lowry, S.R., Isenhour, T.L.: An algorithm for a selective nearest neighbor decision rule. IEEE Transactions on Information Theory 21 (1975) 665-669
6. Gates, G.: The reduced nearest neighbor rule. IEEE Transactions on Information Theory 18 (1972) 431-433
7. Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man, and Cybernetics 2 (1972) 408-421
8. 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
9. 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)
10. Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery 6 (2002) 153-172
11. Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: International Conference on Machine Learning. (1994) 293-301
12. Schölkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge, MA (2002)
13. Gra̧bczewski, K., Duch, W.: A general purpose separability criterion for classification systems. In: 4th Conference on Neural Networks and Their Applications, Zakopane, Poland, Polish Neural Networks Society (1999) 203-208
14. Adamczak, R., Duch, W., Jankowski, N.: New developments in the feature space mapping model. In: Third Conference on Neural Networks and Their Applications, Kule, Poland, Polish Neural Networks Society (1997) 65-70
15. Jankowski, N., Kadirkamanathan, V.: Statistical control of RBF-like networks for classification. In: 7th International Conference on Artificial Neural Networks, Lausanne, Switzerland, Springer-Verlag (1997) 385-390
16. Tomek, I.: An experiment with the edited nearest-neighbor rule. IEEE Transactions on Systems, Man, and Cybernetics 6 (1976) 448-452
17. Grochowski, M.: Wybór wektorów referencyjnych dla wybranych method klasyfikacji. Master's thesis, Department of Informatics, Nicholas Copernicus University, Poland (2003)
18. Jankowski, N.: Data regularization. In Rutkowski, L., Tadeusiewicz, R., eds.: Neural Networks and Soft Computing, Zakopane, Poland (2000) 209-214
19. Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Machine Learning 38 (2000) 257-286
20. Kohonen, T.: Learning vector quantization for pattern recognition. Technical Report TKK-F-A601, Helsinki University of Technology, Espoo, Finland (1986)