Infrequent Weighted Itemset Mining Using Frequent Pattern Growth

Frequent weighted itemsets represent correlations frequently holding in data in which items may weight differently. However, in some contexts, e.g., when the need is to minimize a certain cost function, discovering rare data correlations is more interesting than mining frequent ones. This paper tackles the issue of discovering rare and weighted itemsets, i.e., the infrequent weighted itemset (IWI) mining problem. Two novel quality measures are proposed to drive the IWI mining process. Furthermore, two algorithms that perform IWI and Minimal IWI mining efficiently, driven by the proposed measures, are presented. Experimental results show efficiency and effectiveness of the proposed approach.

[1]  Osmar R. Zaïane,et al.  Application of Data Mining Techniques for Medical Image Classification , 2001, MDM/KDD.

[2]  Edward Hung,et al.  Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.

[3]  Fionn Murtagh,et al.  Weighted Association Rule Mining using weighted support and significance framework , 2003, KDD '03.

[4]  Anthony K. H. Tung,et al.  FARMER: finding interesting rule groups in microarray datasets , 2004, SIGMOD '04.

[5]  Xiangjun Dong,et al.  Mining Infrequent Itemsets Based on Multiple Level Minimum Supports , 2007, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

[6]  Arnab Bhattacharya,et al.  Minimally Infrequent Itemset Mining using Pattern-Growth Paradigm and Residual Trees , 2011, COMAD.

[7]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[8]  Xindong Wu,et al.  Efficient mining of both positive and negative association rules , 2004, TOIS.

[9]  John A. Keane,et al.  A recursive search algorithm for statistical disclosure assessment , 2007, Data Mining and Knowledge Discovery.

[10]  Aleksandra Slavkovic,et al.  "Secure" Logistic Regression of Horizontally and Vertically Partitioned Distributed Databases , 2007 .

[11]  Philip S. Yu,et al.  Efficient mining of weighted association rules (WAR) , 2000, KDD '00.

[12]  Anna M. Manning,et al.  On Minimal Infrequent Itemset Mining , 2007, DMIN.

[13]  Rupert W. Ford,et al.  A Computational Algorithm for Handling the Special Uniques Problem , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[14]  Carson Kai-Sang Leung,et al.  Efficient Mining of Frequent Patterns from Uncertain Data , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

[15]  Ke Sun,et al.  Mining Weighted Association Rules without Preassigned Weights , 2008, IEEE Transactions on Knowledge and Data Engineering.

[16]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[17]  Anna M. Manning,et al.  A new algorithm for finding minimal sample uniques for use in statistical disclosure assessment , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[18]  Hans-Peter Kriegel,et al.  Probabilistic frequent itemset mining in uncertain databases , 2009, KDD.