کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
534991 | 870311 | 2008 | 9 صفحه PDF | دانلود رایگان |
The subgroup discovery is defined as: “given a population of individuals and a property of those individuals, we are interested in finding a population of subgroups as large as possible and in having the most unusual statistical characteristic with respect to the property of interest”.The subgroup discovery algorithms have to face the scaling up problem which appears in the evaluation of large size data sets. In this paper we are interested in the extraction of subgroups from large size data sets. To avoid the scaling up problem, we propose the combination of stratification and instance selection algorithms for scaling down the data set before the subgroup discovery task. In addition, two new stratification models are proposed to increase the presence of minority classes in data sets, which affects to the subgroup discovery process on them. The results show that the subgroup discovery extraction can be executed on large data sets preprocessed independently of the presence of minority classes, which could not be executed in other way.
Journal: Pattern Recognition Letters - Volume 29, Issue 16, 1 December 2008, Pages 2156–2164