Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference10 articles.
1. Yao H, Hamilton H J, Butz C J. A foundational approach to mining itemset utilities from databases. In Proc. the 4th SIAM Int. Conf. Data Min., April 2004, pp.482-486.
2. Ahmed C F, Tanbeer S K, Jeong B S et al. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng., 2009, 21(12):1708-1721.
3. Tseng V A, Shie B E, Wu C W, Yu P S. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng., 2013, 25(8):1772-1786.
4. Pei J, Han J, Lakshmanan L V S. Mining frequent itemsets with convertible constraints. In Proc. the 17th Int. Conf. Data Eng., April 2001, pp.433-442.
5. Li Y X, Yeh J S, Chang C C. Isolated items discarding strategy for discovering high utility itemsets. Data Knowl. Eng., 2008, 64(1): 198-217.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献