Mining Association Rules in Data Warehouses

View Sample PDF

Author(s): Haorianto Cokrowijoyo Tjioe (Monash University, Australia)and David Taniar (Monash University, Australia)
Copyright: 2008
Pages: 33
Source title: Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59904-951-9.ch020

Keywords: Data Mining and Databases / Data Warehousing / Information Science Reference / Library & Information Science

Purchase

View Mining Association Rules in Data Warehouses on the publisher's website for pricing and purchasing information.

Abstract

Data mining applications have enormously altered the strategic decision-making processes of organizations. The application of association rules algorithms is one of the well-known data mining techniques that have been developed to cope with multidimensional databases. However, most of these algorithms focus on multidimensional data models for transactional data. As data warehouses can be presented using a multidimensional model, in this paper we provide another perspective to mine association rules in data warehouses by focusing on a measurement of summarized data. We propose four algorithms — VAvg, HAvg, WMAvg, and ModusFilter — to provide efficient data initialization for mining association rules in data warehouses by concentrating on the measurement of aggregate data. Then we apply those algorithms both on a non-repeatable predicate, which is known as mining normal association rules, using GenNLI, and a repeatable predicate using ComDims and GenHLI, which is known as mining hybrid association rules.

The IRMA Community

Research IRM

Mining Association Rules in Data Warehouses

Purchase

Abstract

Related Content

IRMA Sponsors