Constructing inductive applications by meta-learning with method repositories

Hidenao Abe; Takahira Yamaguchi

Constructing inductive applications by meta-learning with method repositories

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

Here is presented CAMLET that is a platform for automatic composition of inductive applications with method repositories that organize many inductive learning methods. CAMLET starts with constructing a basic design specification for inductive applications with method repositories and data type hierarchy that are specific to inductive learning algorithms. After instantiating the basic design with a given data set into a detailed design specification and then compiling it into codes, CAMLET executes them on computers. CAMLET changes the constructed specification until it goes beyond the goal accuracy given from a user. After having implemented CAMLET on UNIX platforms with Perl and C languages, we have done the case studies of constructing inductive applications for eight different data sets from the StatLog project and have compared the accuracies of the inductive applications composed by CAMLET with all the accuracies from popular inductive learning algorithms. The results have shown us that the inductive applications composed by CAMLET take the first accuracy on the average.

Original language	English
Title of host publication	Progress in Discovery Science
Editors	Setsuo Arikawa, Ayumi Shinohara
Pages	576-585
Number of pages	10
Publication status	Published - 2002 Dec 1
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2281
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

Fingerprint Dive into the research topics of 'Constructing inductive applications by meta-learning with method repositories'. Together they form a unique fingerprint.

Cite this

Abe, H., & Yamaguchi, T. (2002). Constructing inductive applications by meta-learning with method repositories. In S. Arikawa, & A. Shinohara (Eds.), Progress in Discovery Science (pp. 576-585). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2281).

Constructing inductive applications by meta-learning with method repositories. / Abe, Hidenao; Yamaguchi, Takahira.

Progress in Discovery Science. ed. / Setsuo Arikawa; Ayumi Shinohara. 2002. p. 576-585 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2281).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

@inbook{bdb9b80130304ace81b2891382c72a98,

title = "Constructing inductive applications by meta-learning with method repositories",

abstract = "Here is presented CAMLET that is a platform for automatic composition of inductive applications with method repositories that organize many inductive learning methods. CAMLET starts with constructing a basic design specification for inductive applications with method repositories and data type hierarchy that are specific to inductive learning algorithms. After instantiating the basic design with a given data set into a detailed design specification and then compiling it into codes, CAMLET executes them on computers. CAMLET changes the constructed specification until it goes beyond the goal accuracy given from a user. After having implemented CAMLET on UNIX platforms with Perl and C languages, we have done the case studies of constructing inductive applications for eight different data sets from the StatLog project and have compared the accuracies of the inductive applications composed by CAMLET with all the accuracies from popular inductive learning algorithms. The results have shown us that the inductive applications composed by CAMLET take the first accuracy on the average.",

author = "Hidenao Abe and Takahira Yamaguchi",

year = "2002",

month = dec,

day = "1",

language = "English",

isbn = "3540433384",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "576--585",

editor = "Setsuo Arikawa and Ayumi Shinohara",

booktitle = "Progress in Discovery Science",

}

TY - CHAP

T1 - Constructing inductive applications by meta-learning with method repositories

AU - Abe, Hidenao

AU - Yamaguchi, Takahira

PY - 2002/12/1

Y1 - 2002/12/1

N2 - Here is presented CAMLET that is a platform for automatic composition of inductive applications with method repositories that organize many inductive learning methods. CAMLET starts with constructing a basic design specification for inductive applications with method repositories and data type hierarchy that are specific to inductive learning algorithms. After instantiating the basic design with a given data set into a detailed design specification and then compiling it into codes, CAMLET executes them on computers. CAMLET changes the constructed specification until it goes beyond the goal accuracy given from a user. After having implemented CAMLET on UNIX platforms with Perl and C languages, we have done the case studies of constructing inductive applications for eight different data sets from the StatLog project and have compared the accuracies of the inductive applications composed by CAMLET with all the accuracies from popular inductive learning algorithms. The results have shown us that the inductive applications composed by CAMLET take the first accuracy on the average.

AB - Here is presented CAMLET that is a platform for automatic composition of inductive applications with method repositories that organize many inductive learning methods. CAMLET starts with constructing a basic design specification for inductive applications with method repositories and data type hierarchy that are specific to inductive learning algorithms. After instantiating the basic design with a given data set into a detailed design specification and then compiling it into codes, CAMLET executes them on computers. CAMLET changes the constructed specification until it goes beyond the goal accuracy given from a user. After having implemented CAMLET on UNIX platforms with Perl and C languages, we have done the case studies of constructing inductive applications for eight different data sets from the StatLog project and have compared the accuracies of the inductive applications composed by CAMLET with all the accuracies from popular inductive learning algorithms. The results have shown us that the inductive applications composed by CAMLET take the first accuracy on the average.

UR - http://www.scopus.com/inward/record.url?scp=26844475845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844475845&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:26844475845

SN - 3540433384

SN - 9783540433385

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 576

EP - 585

BT - Progress in Discovery Science

A2 - Arikawa, Setsuo

A2 - Shinohara, Ayumi

ER -