%0 Journal Article %1 Lemmerich2016 %A Lemmerich, Florian %A Atzmueller, Martin %A Puppe, Frank %D 2016 %J Data Mining and Knowledge Discovery %K dfg_seq efficient myown subgroup %N 3 %P 711--762 %R 10.1007/s10618-015-0436-8 %T Fast exhaustive subgroup discovery with numerical target concepts %U http://dx.doi.org/10.1007/s10618-015-0436-8 %V 30 %X Subgroup discovery is a key data mining method that aims at identifying descriptions of subsets of the data that show an interesting distribution with respect to a pre-defined target concept. For practical applications the integration of numerical data is crucial. Therefore, a wide variety of interestingness measures has been proposed in literature that use a numerical attribute as the target concept. However, efficient mining in this setting is still an open issue. In this paper, we present novel techniques for fast exhaustive subgroup discovery with a numerical target concept. We initially survey previously proposed measures in this setting. Then, we explore options for pruning the search space using optimistic estimate bounds. Specifically, we introduce novel bounds in closed form and ordering-based bounds as a new technique to derive estimates for several types of interestingness measures with no previously known bounds. In addition, we investigate efficient data structures, namely adapted FP-trees and bitset-based data representations, and discuss their interdependencies to interestingness measures and pruning schemes. The presented techniques are incorporated into two novel algorithms. Finally, the benefits of the proposed pruning bounds and algorithms are assessed and compared in an extensive experimental evaluation on 24 publicly available datasets. The novel algorithms reduce runtimes consistently by more than one order of magnitude.

@article{Lemmerich2016, abstract = {Subgroup discovery is a key data mining method that aims at identifying descriptions of subsets of the data that show an interesting distribution with respect to a pre-defined target concept. For practical applications the integration of numerical data is crucial. Therefore, a wide variety of interestingness measures has been proposed in literature that use a numerical attribute as the target concept. However, efficient mining in this setting is still an open issue. In this paper, we present novel techniques for fast exhaustive subgroup discovery with a numerical target concept. We initially survey previously proposed measures in this setting. Then, we explore options for pruning the search space using optimistic estimate bounds. Specifically, we introduce novel bounds in closed form and ordering-based bounds as a new technique to derive estimates for several types of interestingness measures with no previously known bounds. In addition, we investigate efficient data structures, namely adapted FP-trees and bitset-based data representations, and discuss their interdependencies to interestingness measures and pruning schemes. The presented techniques are incorporated into two novel algorithms. Finally, the benefits of the proposed pruning bounds and algorithms are assessed and compared in an extensive experimental evaluation on 24 publicly available datasets. The novel algorithms reduce runtimes consistently by more than one order of magnitude.}, added-at = {2017-01-12T11:27:48.000+0100}, author = {Lemmerich, Florian and Atzmueller, Martin and Puppe, Frank}, biburl = {https://www.bibsonomy.org/bibtex/2357e5d47645657f9979891aaab72af78/lemmi}, doi = {10.1007/s10618-015-0436-8}, interhash = {4daecd442e9c1399adfc2c96a1d3a5a3}, intrahash = {357e5d47645657f9979891aaab72af78}, issn = {1573-756X}, journal = {Data Mining and Knowledge Discovery}, keywords = {dfg_seq efficient myown subgroup}, number = 3, pages = {711--762}, timestamp = {2017-01-12T11:27:48.000+0100}, title = {Fast exhaustive subgroup discovery with numerical target concepts}, url = {http://dx.doi.org/10.1007/s10618-015-0436-8}, volume = 30, year = 2016 }