A comparison of multi-objective grammar-guided genetic programming methods to multiple instance learning

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

Abstract

This paper develops a first comparative study of multi- objective algorithms in Multiple Instance Learning (MIL) applications. These algorithms use grammar-guided genetic programming, a robust classification paradigm which is able to generate understandable rules that are adapted to work with the MIL framework. The algorithms obtained are based on the most widely used and compared multi-objective evolutionary algorithms. Thus, we design and implement SPG3P-MI based on the Strength Pareto Evolutionary Algorithm, NSG3P-MI based on the Non-dominated Sorting Genetic Algorithm and MOGLG3P-MI based on the Multi-objective genetic local search. These approaches are tested with different MIL applications and compared to a previous single-objective grammar-guided genetic programming proposal. The results demonstrate the excellent performance of multi-objective approaches in achieving accurate models and their ability to generate comprehensive rules in the knowledgable discovery process. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zafra, A., & Ventura, S. (2009). A comparison of multi-objective grammar-guided genetic programming methods to multiple instance learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5572 LNAI, pp. 450–458). https://doi.org/10.1007/978-3-642-02319-4_54

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