Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 2.541

Overview on evolutionary subgroup discovery: analysis of the suitability and potential of the search performed by evolutionary algorithms

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Subgroup discovery (SD) is a descriptive data mining technique using supervised learning. In this article, we review the use of evolutionary algorithms (EAs) for SD. In particular, we will focus on the suitability and potential of the search performed by EAs in the development of SD algorithms. Future directions in the use of EAs for SD are also presented in order to show the advantages and benefits that this search strategy contribute to this task. This article is categorized under: Technologies > Computational Intelligence
Representation of different subgroups in an example problem.
[ Normal View | Magnified View ]
Operation scheme of NMEEF‐SD algorithm.
[ Normal View | Magnified View ]
Operation scheme of MESDIF algorithm.
[ Normal View | Magnified View ]
Operation scheme of GP3‐SD algorithm.
[ Normal View | Magnified View ]
Operation scheme of GAR‐SD algorithm.
[ Normal View | Magnified View ]
Operation scheme of EDER‐SD algorithm.
[ Normal View | Magnified View ]
Operation scheme of SDIGA algorithm.
[ Normal View | Magnified View ]

Browse by Topic

Technologies > Computational Intelligence

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts