Category-Driven Association Rule Mining

Zina M. Ibrahim, Honghan Wu, Robbie Mallah, Richard J. B. Dobson

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Abstract

The quality of rules generated by ontology-driven association rule mining algorithms is constrained by the algorithm’s effectiveness in exploiting the usually large ontology in the mining process. We present a framework built around superimposing a hierarchical graph structure on a given ontology to divide the rule mining problem into disjoint subproblems whose solutions can be iteratively joined to find global associations. We present a new metric for evaluating the interestingness of generated rules based on where their constructs fall within the ontology. Our metric is anti-monotonic on subsets, making it usable in an Apriori-like algorithm which we present here. The algorithm categorises the ontology into disjoint subsets utilising the hierarchical graph structure and uses the metric to find associations in each, joining the results using the guidance of anti-monotonicity. The algorithm optionally embeds built-in definitions of user-specified filters to reflect user preferences. We evaluate the resulting model using a large collection of patient health records.
Original languageEnglish
Title of host publicationResearch and Development in Intelligent Systems XXXIII
EditorsMax Bramer, Miltos Petridis
PublisherSpringer International Publishing AG
Pages21-35
ISBN (Electronic)978-3-319-47175-4
ISBN (Print)978-3-319-47174-7
DOIs
Publication statusPublished - 5 Nov 2016

Fingerprint Dive into the research topics of 'Category-Driven Association Rule Mining'. Together they form a unique fingerprint.

Cite this