A Scalable Vertical Model for Mining Association Rules

Imad Rahal (), Dongmei Ren () and William Perrizo ()
Additional contact information
Imad Rahal: Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA
Dongmei Ren: Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA
William Perrizo: Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA

Journal of Information & Knowledge Management (JIKM), 2004, vol. 03, issue 04, 317-329

Abstract: Association rule mining (ARM) is the data-mining process for finding all association rules in datasets matching user-defined measures of interest such as support and confidence. Usually, ARM proceeds by mining all frequent itemsets — a step known to be very computationally intensive — from which rules are then derived in a straight forward manner. In general, mining all frequent itemsets prunes the space by using the downward closure (or anti-monotonicity) property of support which states that no itemset can be frequent unless all of its subsets are frequent. A large number of papers have addressed the problem of ARM but not many of them have focused on scalability over very large datasets (i.e. when datasets contain a very large number of transactions). In this paper, we propose a new model for representing data and mining frequent itemsets that is based on the P-tree technology for compression and faster logical operations over vertically structured data and on set enumeration trees for fast itemset enumeration. Experimental results presented hereinafter show big improvements for our approach over large datasets when compared to other contemporary approaches in the literature.

Keywords: Association rule mining; frequent itemset mining; apriori; P-trees; set enumeration trees (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219649204000912
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:wsi:jikmxx:v:03:y:2004:i:04:n:s0219649204000912

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219649204000912

Access Statistics for this article

Journal of Information & Knowledge Management (JIKM) is currently edited by Professor Suliman Hawamdeh

More articles in Journal of Information & Knowledge Management (JIKM) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().