WUN-Miner: A new method for mining frequent Weighted Utility itemsets

In this paper, we propose the WUN-set (Weighted Utility Nodeset) structure, an extension of the Nodeset structure, to solve the problem of mining frequent weighted utility itemsets from a quantitative database. Firstly, some theorems are developed to compute quickly the weighted utility support of an itemset. An algorithm is then proposed for the fast mining frequent weighted utility itemsets. The experimental results on both sparse and dense databases show that the proposed method outperforms existing methods.

[1]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[2]  Jie Zhang,et al.  DHUI: A new algorithm for mining high utility itemsets , 2009, 2009 International Conference on Machine Learning and Cybernetics.

[3]  D. Ramkumar,et al.  Weighted Association Rules: Model and Algorithm , 1998 .

[4]  John J. Leggett,et al.  WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight , 2005, SDM.

[5]  Tzung-Pei Hong,et al.  An Improved Algorithm for Mining Frequent Weighted Itemsets , 2015, 2015 IEEE International Conference on Systems, Man, and Cybernetics.

[6]  Tzung-Pei Hong,et al.  An effective tree structure for mining high utility itemsets , 2011, Expert Syst. Appl..

[7]  Unil Yun,et al.  WSpan: Weighted Sequential pattern mining in large sequence databases , 2006, 2006 3rd International IEEE Conference Intelligent Systems.

[8]  Tzung-Pei Hong,et al.  Discovery of high utility itemsets from on-shelf time periods of products , 2011, Expert Syst. Appl..

[9]  Mohammed J. Zaki,et al.  Fast vertical mining using diffsets , 2003, KDD '03.

[10]  Zhonghui Wang,et al.  A new algorithm for fast mining frequent itemsets using N-lists , 2012, Science China Information Sciences.

[11]  Tzung-Pei Hong,et al.  MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases , 2015 .

[12]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

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

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

[15]  Zhi-Hong Deng,et al.  PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning , 2015, Expert Syst. Appl..

[16]  Tzung-Pei Hong,et al.  A New Method for Mining High Average Utility Itemsets , 2014, CISIM.

[17]  Tzung-Pei Hong,et al.  DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets , 2012, Expert Syst. Appl..

[18]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[19]  Ron Rymon,et al.  Search through Systematic Set Enumeration , 1992, KR.

[20]  Tzung-Pei Hong,et al.  An efficient approach for finding weighted sequential patterns from sequence databases , 2014, Applied Intelligence.

[21]  Zhi-Hong Deng,et al.  Fast mining frequent itemsets using Nodesets , 2014, Expert Syst. Appl..

[22]  Raj P. Gopalan,et al.  CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[23]  Gösta Grahne,et al.  Fast algorithms for frequent itemset mining using FP-trees , 2005, IEEE Transactions on Knowledge and Data Engineering.

[24]  M. Sulaiman Khan,et al.  A Weighted Utility Framework for Mining Association Rules , 2008, 2008 Second UKSIM European Symposium on Computer Modeling and Simulation.

[25]  Jason J. Jung,et al.  A Tree-Based Approach for Mining Frequent Weighted Utility Itemsets , 2012, ICCCI.

[26]  Tzung-Pei Hong,et al.  Mining frequent itemsets using the N-list and subsume concepts , 2014, Int. J. Mach. Learn. Cybern..

[27]  Frans Coenen,et al.  A new method for mining Frequent Weighted Itemsets based on WIT-trees , 2013, Expert Syst. Appl..