An efficient approach to categorising association rules
by Dongwoo Won; Dennis McLeod
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 4, No. 4, 2012

Abstract: Association rules are a fundamental data mining technique, used for various applications. In this paper, we present an efficient method to make use of association rules for discovering knowledge from transactional data. First, we approach this problem using an ontology. The hierarchical structure of an ontology defines the generalisation relationship for the concepts of different abstraction levels that are utilised to minimise the search space. Next, we have developed an efficient algorithm, hierarchical association rule categorisation (HARC), which use a novel metric called relevance for categorising association rules. As a result, users are now able to find the needed rules efficiently by searching the compact generalised rules first and then the specific rules that belong to them rather than scanning the entire list of rules.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com