A landmarker selection algorithm based on correlation and efficiency criteria

Daren Ler*, Irena Koprinska, Sanjay Chawla

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

Landmarking is a recent and promising meta-learning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is often made in an ad hoc manner. In this paper, we propose a new perspective and set of criteria for landmarkers. Based on the new criteria, we propose a landmarker generation algorithm, which generates a set of landmarkers that are each subsets of the algorithms being landmarked. Our experiments show that the landmarkers formed, when used with linear regression are able to estimate the accuracy of a set of candidate algorithms well, while only utilising a small fraction of the computational cost required to evaluate those candidate algorithms via ten-fold cross-validation.

Original languageEnglish
Pages (from-to)296-306
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3339
DOIs
Publication statusPublished - 2004
Externally publishedYes
Event17th Australian Joint Conference on Artificial Intelligence, AI 2004: Advances in Artificial Intelligence - Cairns, Australia
Duration: 4 Dec 20046 Dec 2004

Fingerprint

Dive into the research topics of 'A landmarker selection algorithm based on correlation and efficiency criteria'. Together they form a unique fingerprint.

Cite this