Support-Less Association Rule Mining Using Tuple Count Cube
Qin Ding () and
William Perrizo ()
Additional contact information
Qin Ding: Department of Computer Science, East Carolina University, Greenville, NC 27858, USA
William Perrizo: Department of Computer Science, North Dakota State University, Fargo, ND 58105, USA
Journal of Information & Knowledge Management (JIKM), 2007, vol. 06, issue 04, 271-280
Abstract:
Association rule mining is one of the important tasks in data mining and knowledge discovery (KDD). The traditional task of association rule mining is to find all the rules with high support and high confidence. In some applications, we are interested in finding high confidence rules even though the support may be low. This type of problem differs from the traditional association rule mining problem; hence, it is called support-less association rule mining. Existing algorithms for association rule mining, such as the Apriori algorithm, cannot be used efficiently for support-less association rule mining since those algorithms mostly rely on identifying frequent item-sets with high support. In this paper, we propose a new model to perform support-less association rule mining, i.e., to derive high confidence rules regardless of their support level. A vertical data structure, the Peano Count Tree (P-tree), is used in our model to represent all the information we need. Based on the P-tree structure, we build a special data cube, called the Tuple Count Cube (T-cube), to derive high confidence rules. Data cube operations, such as roll-up, on T-cube, provide efficient ways to calculate the count information needed for support-less association rule mining.
Keywords: Data mining and knowledge discovery; association rule mining; support-less association rules; data cube (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219649207001846
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:06:y:2007:i:04:n:s0219649207001846
Ordering information: This journal article can be ordered from
DOI: 10.1142/S0219649207001846
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 ().