Finding efficiencies in frequent pattern mining from big uncertain data

2016 ◽  
Vol 20 (3) ◽  
pp. 571-594 ◽  
Author(s):  
Carson Kai-Sang Leung ◽  
Richard Kyle MacKinnon ◽  
Fan Jiang
2017 ◽  
Vol 10 (13) ◽  
pp. 191
Author(s):  
Nikhil Jamdar ◽  
A Vijayalakshmi

There are many algorithms available in data mining to search interesting patterns from transactional databases of precise data. Frequent pattern mining is a technique to find the frequently occurred items in data mining. Most of the techniques used to find all the interesting patterns from a collection of precise data, where items occurred in each transaction are certainly known to the system. As well as in many real-time applications, users are interested in a tiny portion of large frequent patterns. So the proposed user constrained mining approach, will help to find frequent patterns in which user is interested. This approach will efficiently find user interested frequent patterns by applying user constraints on the collections of uncertain data. The user can specify their own interest in the form of constraints and uses the Map Reduce model to find uncertain frequent pattern that satisfy the user-specified constraints 


2013 ◽  
Vol 86 (3) ◽  
pp. 759-778 ◽  
Author(s):  
Ying-Ho Liu ◽  
Chun-Sheng Wang

Sign in / Sign up

Export Citation Format

Share Document