Autonomous clustering for machine learning

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

Abstract

In this paper, starting from a collection of training examples, we show how to produce a very compact set of classification rules. The induction idea is a clustering principle based on Kohonen's self-organizing algorithms. The function to optimize in the aggregation of examples to become rules is a classificatory quality measure called impurity level, which was previously employed in our system called FAN. The rule conditions obtained in this way are densely populated areas in the attribute space. The main goal of our system, in addition to its accuracy, is the high quality of explanations that it can provide attached to the classification decisions.

Cite

CITATION STYLE

APA

Luaces, O., del Coz, J. J., Quevedo, J. R., Alonso, J., Ranilla, J., & Bahamonde, A. (1999). Autonomous clustering for machine learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1606, pp. 497–506). Springer Verlag. https://doi.org/10.1007/BFb0098207

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