Efficient Algorithms for Mining Closed Frequent Itemset and Generating Rare Association Rules fromUncertain Databases
Journal Title: International Journal of Scientific Research and Management - Year 2013, Vol 1, Issue 2
Abstract
Dealing with uncertainty has gained increasing attention in the past few years in both static and streaming data management and mining. Data uncertainty is inherent in emerging applications such as location - based services, sensor monitoring syst ems and data integration. Specifically some privacy – preserving data stream mining applications like banking sectors operate on uncertain data and they need to mine frequent itemsets. There are many existing works on mining frequent itemsets from uncertain databases. They use the expected support of an itemset from an uncertain database to define whether it is frequent or not. Itemsets are considered frequent if its expected support exceeds the minimum support threshold. There are two main problems with this approach of mining frequent itemsets from uncertain databases. The first problem is that often too many frequent itemsets are generated many of which may prove to be irrelevant. The second is that only expected support is calculated to define frequent ite msets as being those whose expected support exceeds the minimum support. To overcome both these problems closed frequent itemset mining can be used. An itemset X is said to be closed, if and only if none of its superset has the same support. The mining pro cess can be done by using Poisson Binomial Distribution. Closed frequent itemsets are extracted by an approximate mining algorithm which can effectively and accurately discover closed frequent itemsets in large uncertain databases. It can be extended to ge nerate the rare association rules within the given support and confidence framework. In a practical scenario, there can be some itemsets which have significance and can provide useful knowledge but their support counts are relatively less. To extract the r elationship among those itemsets having less frequency of occurrences, rare association rule mining came into existence.
Authors and Affiliations
A. L. Greenie Geevlin
Keywords
Related Articles
- EP ID EP206419
- DOI -
- Views 152
- Downloads 0
Wireless m onitoring of Soil moisture & humidity using Zigbee in Agriculture
The main objective of the present paper is to develop a smart wireless sensor network (WSN) for an agricultural environment. Monitoring agricultural environment for various factors such as soil moisture...
Image with the Most Dynamic Screen Pixel Recovery Algorithm
I mage has editing applications such as security surveillance and warm rain that is very useful and important technique . Many rain removal instructions have optics , color and rain effect to demonstrate the abi...
“ Modified Apriori Algorithm For Efficient Web Navigation Data Mining ”
Web Data mining can be defined as knowledge discovery and analysis of useful information from the web . It is the process of determining user accessibility pattern, during the mining of log files and...
Students’ Thinking Process in Constructing the Concepts of Linear Quantities Two Variables
T his reseach aimed at analyzing the students’ thinking process in cunstructing the concepts of linear quantities two variables. The participants were 6 students of grade 8 on junior high school in Jember Regenc y, East...
Status of Elementary Education In India
It is widely accepted that education is an important instrument of social transformation and economic development of the country (Caldwell, Reddy and Caldwell, 1985 , Tilak, 2003) ....