Frequent Itemset Mining with Constraints-Reference-Cited by-同舟云学术

Frequent Itemset Mining with Constraints

Published:2016 Issue: Volume: Page:1-6
ISSN:
Container-title:Encyclopedia of Database Systems
language:
Short-container-title:

Author:

Leung Carson Kai-Sang

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4899-7993-3_170-2

Reference15 articles.

1. Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD international conference on management of data; 2003, p. 207–16.

2. Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases; 1994, p. 487–99.

3. Bonchi F, Lucchese C. Pushing tougher constraints in frequent pattern mining. In: Advances in knowledge discovery and data mining, 9th Pacific-Asia conference; 2005, p. 114–24.

4. Bucila C, Gehrke J, Kifer D, White W. DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining; 2002, p. 42–51.

5. Cuzzocrea A, Leung CK-S, MacKinnon RK. Mining constrained frequent itemsets from distributed uncertain data. Futur Gener Comput Syst. 2014;37:117–26. doi:10.1016/j.future.2013.10.026.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constrained Frequent Pattern Mining from Big Data Via Crowdsourcing;Big Data Applications and Services 2017;2018-08-17

2. Constrained Big Data Mining in an Edge Computing Environment;Big Data Applications and Services 2017;2018-08-17

3. Item-centric mining of frequent patterns from big uncertain data;Procedia Computer Science;2018