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

Bilateral Filtering using Modified Fuzzy Clustering for Image Denoising

This paper presents a novel bilateral filtering using weighed cm algorithm based on Gaussian kernel function for image manipulations such as segmentation and denoising . Our roposed bilateral filtering consists of the...

Automated System for interpreting Non-verbal Communication in Video Conferencing

Gesture is a form of non-verbal, action-based communication made with a part of the body and used instead of and/or in combination with verbal communication. People frequently use gestures for more effective inter-person...

WaveCluster for Remote Sensing Image Retrieval

Wave Cluster is a grid based clustering approach. Many researchers have applied wave cluster technique for segmenting images. Wave cluster uses wave transformation for clustering the data item. Normally it uses Haar, Dau...

A Single Hidden Layered Fuzzy Back propagation Algorithm for Joint Radio Resource Management in Radio Access Systems

In this paper, we propose a single hidden layered fuzzy neural algorithm, which is able to provide a better quality of service constraints in a multi-cell scenario with three different radio access technologies (RATs) na...

Problem Analysis of Routing Protocols in MANET in Constrained Situation

A Mobile Ad-hoc network (MANET) consists of a number of mobile wireless nodes, among which the communication is carried out without having any centralized control. MANET is a self organized, self configurable network hav...

Download PDF file
  • EP ID EP92782
  • DOI -
  • Views 114
  • Downloads 0

How To Cite

Nidhi Sharma, Anju Singh (2012). K-Partition Model for Mining Frequent Patterns in Large Databases. International Journal on Computer Science and Engineering, 4(9), 1505-1512. https://europub.co.uk/articles/-A-92782