Making CN 2-SD subgroup discovery algorithm scalable to large size data sets using instance selection q

@inproceedings{Cano2008MakingC2,
  title={Making CN 2-SD subgroup discovery algorithm scalable to large size data sets using instance selection q},
  author={J. Cano and Francisco Herrera and Manuel Lozano},
  year={2008}
}
The subgroup discovery, domain of application of CN2-SD, 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 have the most unusual statistical characteristic with respect to the property of interest’’. The subgroup discovery algorithm CN2-SD, based on a separate and conquer strategy, has to face the scaling problem which appears in the evaluation of large size data sets. To avoid… CONTINUE READING