DMSA TECHNIQUE FOR FINDING SIGNIFICANT PATTERNS IN LARGE DATABASE
Journal Title: International Journal on Computer Science and Engineering - Year 2015, Vol 7, Issue 11
Abstract
Frequent pattern mining in databases plays a vital role in many data mining tasks like classification, sequential patters, clustering, association rules analysis etc. There are numerous mining algorithms for finding association rules. One of the most common algorithms is Apriori. It is used to mine frequent item sets from large database. It uses the support statistical measure for pruning the frequent items. When the higher minimum support is used to reduce the number of frequent items for rules generation, this algorithm misses some of the bigger combination of significant frequent items. This proposed DMSA (Dynamic Minimum Support Apriori) generates significant frequent items in large database for association rules generation.
Authors and Affiliations
Saravanan. Suba , Dr. Christopher. T
Keywords
Related Articles
- EP ID EP112016
- DOI -
- Views 117
- Downloads 0
Trust Based Decision Making System on MANET
Ad hoc networks are new model of networks offering unrestricted mobility without any underlying infrastructure. Mobile ad hoc are gaining popularity because of availability of low cost mobile devices and its ability to p...
Traffic Engineering without Congestion Hot Spots in MPLS
Traffic Engineering [1] broadly relates to optimization of the performance of the operational IP network. In networking, network congestion occurs when a link or node is carrying so much data that its quality of service...
SEGMENTATION OF CT SCAN LUMBAR SPINE IMAGE USING MEDIAN FILTER AND CANNY EDGE DETECTION ALGORITHM
The lumbar vertebrae are the largest segments of the movable part of the vertebral column, they are elected L1 to L5, starting at the top. The spinal column, more commonly called the backbone, is made up primarily of ver...
Weighted Clustering Based Preemptive Scheduling For Real Time System
In this paper a new improved clustering based scheduling algorithm for a single processor environment is proposed. In the proposed method, processes are organized into non-overlapping clusters. For each process the varia...
An Optimized Round Robin Scheduling Algorithm for CPU Scheduling
The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CP...