Tightening Upper Bounds to the Expected Support for Uncertain Frequent Pattern Mining-Reference-Cited by-同舟云学术

Tightening Upper Bounds to the Expected Support for Uncertain Frequent Pattern Mining

Published:2014 Issue: Volume:35 Page:328-337
ISSN:1877-0509
Container-title:Procedia Computer Science
language:en
Short-container-title:Procedia Computer Science

Author:

Leung Carson K.,MacKinnon Richard Kyle,Tanbeer Syed K.

Publisher

Elsevier BV

Subject

General Engineering

Reference24 articles.

1. Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Proceedings of the VLDB 1994. Morgan Kaufmann; 1994, p. 487-499.

2. Frequent pattern mining with uncertain data;Aggarwal,2009

3. Probabilistic frequent itemset mining in uncertain databases;Bernecker,2009

4. Vertical frequent pattern mining from uncertain data;Budhia,2012

5. Efficient pattern mining of uncertain data with sampling;Calders,2010

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

1. ITUFP: A fast method for interactive mining of Top-K frequent patterns from uncertain data;Expert Systems with Applications;2023-03

2. A Data Stream Cleaning System Using Edge Intelligence for Smart City Industrial Environments;IEEE Transactions on Industrial Informatics;2022-02

3. UP-tree & UP-Mine: A fast method based on upper bound for frequent pattern mining from uncertain data;Engineering Applications of Artificial Intelligence;2021-11

4. ILUNA: Single-pass incremental method for uncertain frequent pattern mining without false positives;Information Sciences;2021-07

5. A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives;Future Generation Computer Systems;2017-03