Subgroup discovery with linguistic rules

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

Abstract

Subgroup discovery can be defined as a form of supervised inductive learning in which, given a population of individuals and a specific property of individuals in which we are interested, find population subgroups that have the most unusual distributional characteristics with respect to the property of interest. Subgroup discovery algorithms aim at discovering individual rules, which must be represented in explicit symbolic form and which must be simple and understandable in order to be recognized as actionable by potential users. A fuzzy approach for a subgroup discovery process, which considers linguistic variables with linguistic terms in descriptive fuzzy rules, lets us obtain knowledge in a similar way of the human thought process. Linguistic rules are naturally inclined towards coping with linguistic knowledge and to produce more interpretable and actionable solutions. This chapter analyzes the use of linguistic rules for modelling this problem, and shows a genetic extraction model for learning this kind of rules. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

del Jesus, M. J., González, P., & Herrera, F. (2008). Subgroup discovery with linguistic rules. Studies in Fuzziness and Soft Computing, 220, 411–430. https://doi.org/10.1007/978-3-540-73723-0_21

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