A new landmarker generation algorithm based on correlativity

Landmarking is a recent and promising metalearning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is made in an ad hoc manner. In this paper, we propose a new perspective and set of criteria for landmarkers. With these, we introduce a landmarker generation algorithm, which creates a set of landmarkers that each utilise subsets of the algorithms being landmarked. The experiments show that the landmarkers formed, when used with linear regression, are able to estimate accuracy well, even when utilising a small fraction of the given algorithms.

• Type: Conference
• Year: 2004
• Where: ICMLA
• Authors: Daren Ler, Irena Koprinska, Sanjay Chawla
• Keywords: Ad Hoc Manner, Efficient Learning Algorithms, ICMLA 2004, ICMLA 2007, Promising Metalearning Strategy