On Subgroup Discovery in Numerical Domains
Abstract
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discovery algorithms have been presented in the past, they focus on databases with nominal attributes or make use of discretization to get rid of the numerical attributes. In this paper, we illustrate why the replacement of numerical attributes by nominal attributes can result in suboptimal results. Thereafter, we present a new subgroup discovery algorithm that prunes large parts of the search space by exploiting bounds between related numerical subgroup descriptions. The same algorithm can also be applied to ordinal attributes. In an experimental section, we show that the use of our new pruning scheme results in a huge performance gain when more that just a few split-points are considered for the numerical attributes.
Cite
Text
Grosskreutz and Rüping. "On Subgroup Discovery in Numerical Domains." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009. doi:10.1007/978-3-642-04180-8_15Markdown
[Grosskreutz and Rüping. "On Subgroup Discovery in Numerical Domains." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009.](https://mlanthology.org/ecmlpkdd/2009/grosskreutz2009ecmlpkdd-subgroup/) doi:10.1007/978-3-642-04180-8_15BibTeX
@inproceedings{grosskreutz2009ecmlpkdd-subgroup,
title = {{On Subgroup Discovery in Numerical Domains}},
author = {Grosskreutz, Henrik and Rüping, Stefan},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2009},
pages = {30},
doi = {10.1007/978-3-642-04180-8_15},
url = {https://mlanthology.org/ecmlpkdd/2009/grosskreutz2009ecmlpkdd-subgroup/}
}