An efficient approach to categorising association rules

Dongwoo Won and Dennis McLeod

International Journal of Data Mining, Modelling and Management, 2012, vol. 4, issue 4, 309-333

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.

Keywords: association rules; categorisation; data mining; market basket data; ontologies; relevance; transactional data. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=49881 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:4:y:2012:i:4:p:309-333

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().