UP-Hist Tree : efficient data structure for high utility pattern mining from transaction databases
暂无分享,去创建一个
[1] Zhan Li,et al. Knowledge and Information Systems , 2007 .
[2] Ying Liu,et al. A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.
[3] Qiang Yang,et al. Mining high utility itemsets , 2003, Third IEEE International Conference on Data Mining.
[4] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[5] Suh-Yin Lee,et al. Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[6] Philip S. Yu,et al. Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.
[7] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[8] Longbing Cao,et al. Efficiently Mining Top-K High Utility Sequential Patterns , 2013, 2013 IEEE 13th International Conference on Data Mining.
[9] Philip S. Yu,et al. UP-Growth: an efficient algorithm for high utility itemset mining , 2010, KDD.
[10] Yang Liu,et al. An Algorithm of Top-k High Utility Itemsets Mining over Data Stream , 2014, J. Softw..
[11] A. Choudhary,et al. A fast high utility itemsets mining algorithm , 2005, UBDM '05.
[12] Philip S. Yu,et al. Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments , 2011, DASFAA.
[13] Philip S. Yu,et al. Mining top-K high utility itemsets , 2012, KDD.
[14] Young-Koo Lee,et al. Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.
[15] Philip S. Yu,et al. Online mining of temporal maximal utility itemsets from data streams , 2010, SAC '10.