Comparing meta-learning algorithms

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we compare the performance of KNOMA (Knowledge Mining Approach), a meta-learning approach for integration of rule-based classifiers, based on different rule inducers. Meta-learning approaches use a core learning algorithm for the generation of base classifiers that are further combined into a global one. This approach improves performance and scalability of data mining processes on large datasets. In a previous work we presented KNOMA, a meta-learning approach whose performance was evaluated using RIPPER as its core learning algorithm. Experiments have shown that the performance of KNOMA is comparable to that achieved with Bagging and Boosting. However, meta-learning is generally only sensitive to core algorithms used in the generation of base classifiers. KNOMA is a generic approach and can handle different rule-based inducers, although its advantages, drawbacks and use cases need to be precisely identified. We studied the variation of performance in the approach with base classifiers generated by two rule inducers (C45Rules and RIPPER) and also by C4.5. Interesting behaviors have been noticed in the experiments. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Enembreck, F., & Ávila, B. C. (2006). Comparing meta-learning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4140 LNAI, pp. 289–298). Springer Verlag. https://doi.org/10.1007/11874850_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free