NUCLEAR: AN EFFICIENT METHOD FOR MINING FREQUENT ITEMSETS BASED ON KERNELS AND EXTENDABLE SETS

Frequent itemset (FI) mining is an interesting data mining task. Directly mining the FIs from data often requires lots of time and memory, and should be avoided in many cases. A more preferred approach is to mine only the frequent closed itemsets (FCIs) first and then extract the FIs for each FCI because the number of FCIs is usually much less than that of the FIs. However, some algorithms require the generators for each FCI to extract the FIs, leading to an extra cost. In this paper, based on the concepts of “kernel set” and “extendable set”, we introduce the NUCLEAR algorithm which easily and quickly induces the FIs from the lattice of FCIs without the need of the generators. Experimental results showed that NUCLEAR is effective as compared to previous studies, especially, the time for extracting the FIs is usually much smaller than that for mining the FCIs.

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

[2]  Hoai Bac Le,et al.  An Approach for Mining Concurrently Closed Itemsets and Generators , 2013, Advanced Computational Methods for Knowledge Engineering.

[3]  Ashok Kumar Das,et al.  An effective association rule mining scheme using a new generic basis , 2014, Knowledge and Information Systems.

[4]  Osmar R. Zaïane,et al.  Fast parallel association rule mining without candidacy generation , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[5]  Tin C. Truong,et al.  Structure of Set of Association Rules Based on Concept Lattice , 2010, Advances in Intelligent Information and Database Systems.

[6]  Arnon Rungsawang,et al.  Parallel association rule mining based on FI-growth algorithm , 2007, 2007 International Conference on Parallel and Distributed Systems.

[7]  Bay Vo,et al.  The lattice‐based approaches for mining association rules: a review , 2016, WIREs Data Mining Knowl. Discov..

[8]  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..

[9]  Loan T. T. Nguyen,et al.  An efficient approach for mining closed high utility itemsets and generators , 2017, J. Inf. Telecommun..

[10]  Philippe Fournier-Viger,et al.  A survey of itemset mining , 2017, WIREs Data Mining Knowl. Discov..

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

[12]  Bay Vo,et al.  Interestingness measures for association rules: Combination between lattice and hash tables , 2011, Expert Syst. Appl..

[13]  Hoai Bac Le,et al.  Efficient Algorithms for Mining Frequent Itemsets with Constraint , 2011, 2011 Third International Conference on Knowledge and Systems Engineering.

[14]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[15]  Hoai Bac Le,et al.  Structures of Association Rule Set , 2012, ACIIDS.

[16]  Unil Yun,et al.  Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control , 2017, IEEE Transactions on Industrial Electronics.

[17]  Mohammed J. Zaki.  Mining Non-Redundant Association Rules , 2004, Data Min. Knowl. Discov..

[18]  Tzung-Pei Hong,et al.  An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining , 2014, Applied Intelligence.

[19]  Bac Le,et al.  Mining traditional association rules using frequent itemsets lattice , 2009, 2009 International Conference on Computers & Industrial Engineering.

[20]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[21]  Amedeo Napoli,et al.  Efficient Vertical Mining of Frequent Closures and Generators , 2009, IDA.

[22]  Zhi-Hong Deng,et al.  DiffNodesets: An efficient structure for fast mining frequent itemsets , 2015, Appl. Soft Comput..

[23]  Di He,et al.  Association rule mining algorithms on high-dimensional datasets , 2018, Artificial Life and Robotics.

[24]  Gerd Stumme,et al.  Efficient Mining of Association Rules Based on Formal Concept Analysis , 2005, Formal Concept Analysis.

[25]  Vipin Kumar,et al.  Scalable parallel data mining for association rules , 1997, SIGMOD '97.

[26]  Alexandre Termier,et al.  Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses , 2010, 2010 International Conference on High Performance Computing & Simulation.

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

[28]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[29]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[30]  Bay Vo,et al.  A lattice-based approach for mining high utility association rules , 2017, Inf. Sci..

[31]  Bart Goethals,et al.  FIMI'03: Workshop on Frequent Itemset Mining Implementations , 2003 .