Overview of the SLAVE learning algorithm: A review of its evolution and prospects

24Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Abstract: Inductive learning has been—and still is—one of the most important methods that can be applied in classification problems. Knowledge is usually represented using rules that establish relationships between the problem variables. SLAVE (Structural Learning Algorithm in a Vague Environment) was one of the first fuzzy-rule learning algorithms, and since its first implementation in 1994 it has been frequently used to benchmark new algorithms. Over time, the algorithm has undergone several modifications, and identifying the different versions developed is not an easy task. In this work we present a study of the evolution of the SLAVE algorithm from 1996 to date, marking the most important landmarks as definitive versions. In order to add these final versions to the KEEL platform, Java implementations have been developed. Finally, we describe the parameters used and the results obtained in the experimental study.

Cite

CITATION STYLE

APA

García, D., González, A., & Pérez, R. (2014). Overview of the SLAVE learning algorithm: A review of its evolution and prospects. International Journal of Computational Intelligence Systems, 7(6), 1194–1221. https://doi.org/10.1080/18756891.2014.967008

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