K-Partition Model for Mining Frequent Patterns in Large Databases
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 9
Abstract
Mining frequent patterns has always been a great field of research for investigators. Various algorithms were developed for finding out frequent patterns in an efficient manner. But the major drawback of all these researches is the increased number of database scans. Partition algorithm is one of the approaches for mining frequent patterns but the large number of database scans required in this algorithm makes the mining process slow. Few developments have succeeded in reducing the number of database scans to two. Here an attempt has been made to develop a K-Partition algorithm which requires one database scan. Whole database is compressed in the form of Karnaugh Map, having very small size i.e. a fraction of the whole database. Then partition algorithm can be used to identify frequent patterns using K-Map model. Thus this approach brings efficiency in terms of time taken by processor for mining frequent patterns.
Authors and Affiliations
Nidhi Sharma , Anju Singh
Keywords
Related Articles
- EP ID EP92782
- DOI -
- Views 126
- Downloads 0
Devanagari Isolated Character Recognition by using Statistical features ( Foreground Pixels Distribution, Zone Density and Background Directional Distribution feature and SVM Classifier)
In this paper, we present a methodology for off-line Isolated handwritten Devanagari character recognition. The proposed methodology relies on a three feature extraction techniques. The first technique is based on recurs...
RECOVERY ALGORITHM FOR TRANSACTION FRAMEWORK IN WIRELESS MOBILE ENVIRONMENT
Data processing capability and data storage capacity of mobile handheld devices facilitate transaction processing. Normally mobile internet transactions enable multiple users to involve in on-line transaction processing...
SOFTWARE ARCHITECTURE RECOVERY WITH ERROR TOLERANCE AND PENALTY COST IN GRAPH MINING
In the vast literature Software architecture has been recovered through graphs During Software Architecture recovery generally matching will takes place between Source graph and Query graph. Graph matching is one of the...
Building an OSS Quality Estimation Model with CATREG
Open Source Software (OSS) has been a popular form in software development. In this paper, we use statistical approaches to derive OSS quality estimation models. Our objective is to build estimation models for the numbe...
HIDDEN WEB EXTRACTOR DYNAMIC WAY TO UNCOVER THE DEEP WEB
In this era of digital tsunami of information on the web, everyone is completely dependent on the WWW for information retrieval. This has posed a challenging problem in extracting relevant data. Traditional web crawlers...