Semantic Analysis of Association Rules

When applying association mining to real datasets, a major obstacle is that often a huge number of rules are generated even with very reasonable support and confidence. Among these rules, many are trivial, redundant, semantically wrong, or already known by end-users. Association rule postprocessing aims to remove these undesired rules. Existing work mainly focuses on reducing redundant or finding unexpected association rules. In this paper, we propose an innovative method based on semantic network. We semantically divide association rules into five categories: trivial, known and correct, unknown and correct, known and incorrect, unknown and incorrect. Our method can be efficiently integrated with existing rule reduction techniques to construct a concise, high-quality, and user-specific association rule set. We evaluate our approach on a real public-health dataset, the Heartfelt study, and we can prune off 97.81% of association rules that are trivial or incorrect. The remaining rules a...

• Type: Conference
• Year: 2008
• Where: FLAIRS
• Authors: Ping Chen, Rakesh M. Verma, Janet C. Meininger, Wenyaw Chan
• Keywords: Artificial Intelligence, Association Rules, FLAIRS 2008, Rule Postprocessing Aims, Unexpected Association Rules