Meta-Learning by Landmarking Various Learning Algorithms

Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a source for the definition of metaattributes. Contrary to such approaches, landmarking tries to determine the location of a specific learning problem in the space of all learning problems by directly measuring the performance of some simple and efficient learning algorithms themselves. In the experiments reported we show how such a use of landmark values can help to distinguish between areas of the learning space favouring different learners. Experiments, both with artificial and real-world databases, show that landmarking selects, with moderate but reasonable level of success, the best performing of a set of learning algorithms.

[1]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[2]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[3]  Cullen Schaffer,et al.  A Conservation Law for Generalization Performance , 1994, ICML.

[4]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[5]  William W. Cohen Fast Effective Rule Induction , 1995, ICML.

[6]  金田 重郎,et al.  C4.5: Programs for Machine Learning (書評) , 1995 .

[7]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[8]  Huan Liu,et al.  Book review: Machine Learning, Neural and Statistical Classification Edited by D. Michie, D.J. Spiegelhalter and C.C. Taylor (Ellis Horwood Limited, 1994) , 1996, SGAR.

[9]  A. Clark,et al.  Trading spaces: Computation, representation, and the limits of uninformed learning , 1997, Behavioral and Brain Sciences.

[10]  Hilan Bensusan,et al.  God Doesn't Always Shave with Occam's Razor - Learning When and How to Prune , 1998, ECML.

[11]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[12]  Jo Ao Gama Discriminant Trees , 1999 .

[13]  Rudi Studer,et al.  AST: Support for Algorithm Selection with a CBR Approach , 1999, PKDD.

[14]  Hilan Bensusan,et al.  Automatic bias learning: an inquiry into the inductive basis of induction , 1999 .

[15]  Ljup Co Todorovski,et al.  Experiments in Meta-level Learning with Ilp , 1999 .