Wlodzislaw Duch,
Karol Grudzinski.
Department of Informatics,
Nicholas Copernicus University,
Grudziadzka 5, 87-100 Torun, Poland.
Final version published in
Proceedings of the International Conference on Neural Information Processing (ICONIP),
Shanghai 2001, Vol. I, pp. 235-240
There is no free lunch, no single learning algorithm that will outperform other algorithms on all data. In practice different approaches are tried and the best algorithm selected. An alternative solution is to build new algorithms on demand by creating a framework that accommodates many algorithms. The best combination of parameters and procedures is searched here in the space of all possible models belonging to the framework of Similarity-Based Methods (SBMs). Such meta-learning approach gives a chance to find the best method in all cases. Issues related to the meta-learning and first tests of this approach are presented.
Paper in PDF, 46 KB
BACK to the publications of W. Duch.
BACK to the on-line publications of the Department of Informatics, NCU.