The problem of cluster-grouping is defined. It integrates subgroup discovery, mining correlated patterns and aspects from clustering. The algorithm CG for solving cluster-grouping problems is presented and experimentally evaluated on a number of real-life data sets. The results indicate that the algorithm improves upon the subgroup discovery algorithm CN2-WRACC and is competitive with the clustering algorithm CobWeb.
展开▼