APRIORI-SD: ADAPTING ASSOCIATION RULE LEARNING TO SUBGROUP DISCOVERY

Branko Kavšek, Nada Lavrač

Applied Artificial Intelligence · 2006 · 138 citations · 13 references

Concepts

TL;DR

The paper introduces APRIORI‑SD, an algorithm that adapts association rule learning to subgroup discovery to better understand weighted covering and weighted relative accuracy heuristics via ROC analysis. APRIORI‑SD employs a weighted covering algorithm and weighted relative accuracy heuristic, and is benchmarked against CN2‑SD and SubgroupMiner. Experiments on UCI and UK traffic‑accident data show APRIORI‑SD produces smaller, higher‑coverage, more significant rule sets and competes with state‑of‑the‑art subgroup discovery methods.

Abstract

This paper presents a subgroup discovery algorithm APRIORI-SD, developed by adapting association rule learning to subgroup discovery. The paper contributes to subgroup discovery, to a better understanding of the weighted covering algorithm, and the properties of the weighted relative accuracy heuristic by analyzing their performance in the ROC space. An experimental comparison with rule learners CN2, RIPPER, and APRIORI-C on UCI data sets demonstrates that APRIORI-SD produces substantially smaller rulesets, where individual rules have higher coverage and significance. APRIORI-SD is also compared to subgroup discovery algorithms CN2-SD and SubgroupMiner. The comparisons performed on U.K. traffic accident data show that APRIORI-SD is a competitive subgroup discovery algorithm.

References

13