CLS-Miner: efficient and effective closed high-utility itemset mining

[1]  Kenli Li,et al.  A Parallel Random Forest Algorithm for Big Data in a Spark Cloud Computing Environment , 2017, IEEE Transactions on Parallel and Distributed Systems.

[2]  Wei Song,et al.  A high utility itemset mining algorithm based on subsume index , 2016, Knowledge and Information Systems.

[3]  Philippe Fournier-Viger,et al.  FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction , 2016, IEA/AIE.

[4]  Philippe Fournier-Viger,et al.  An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies , 2016, Knowl. Based Syst..

[5]  Kenli Li,et al.  An efficient algorithm for mining top-rank-k frequent patterns , 2016, Applied Intelligence.

[6]  Vincent S. Tseng,et al.  Mining closed+ high utility itemsets without candidate generation , 2015, 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI).

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

[8]  Philip S. Yu,et al.  Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility Itemsets , 2015, IEEE Transactions on Knowledge and Data Engineering.

[9]  Philippe Fournier-Viger,et al.  FHN: Efficient Mining of High-Utility Itemsets with Negative Unit Profits , 2014, ADMA.

[10]  Vincent S. Tseng,et al.  Novel Concise Representations of High Utility Itemsets Using Generator Patterns , 2014, ADMA.

[11]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[12]  Amedeo Napoli,et al.  A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes , 2013, Annals of Mathematics and Artificial Intelligence.

[13]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.

[14]  Philip S. Yu,et al.  Efficient algorithms for mining maximal high utility itemsets from data streams with different models , 2012, Expert Syst. Appl..

[15]  Mengchi Liu,et al.  Mining high utility itemsets without candidate generation , 2012, CIKM.

[16]  Qiang Yang,et al.  Three challenges in data mining , 2010, Frontiers of Computer Science in China.

[17]  Young-Koo Lee,et al.  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[18]  Mohammed J. Zaki,et al.  GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets , 2005, Data Mining and Knowledge Discovery.

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

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

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

[22]  Qiang Yang,et al.  Mining high utility itemsets , 2003, Third IEEE International Conference on Data Mining.

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

[24]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[25]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[26]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

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

[28]  Philip S. Yu,et al.  Efficient Algorithms for Mining Top-K High Utility Itemsets , 2016, IEEE Transactions on Knowledge and Data Engineering.

[29]  Antonio Gomariz,et al.  SPMF: a Java open-source pattern mining library , 2014, J. Mach. Learn. Res..

[30]  Yu Liu,et al.  BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap , 2014, Int. J. Data Warehous. Min..

[31]  Wei Song,et al.  Mining high utility itemsets by dynamically pruning the tree structure , 2013, Applied Intelligence.

[32]  Tzung-Pei Hong,et al.  An efficient projection-based indexing approach for mining high utility itemsets , 2012, Knowledge and Information Systems.

[33]  Salvatore Orlando,et al.  Fast and memory efficient mining of frequent closed itemsets , 2006, IEEE Transactions on Knowledge and Data Engineering.

[34]  J. Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[35]  Hiroki Arimura,et al.  LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets , 2004, FIMI.

[36]  R. Agarwal.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.