International Conference on Communication Technology |
Foundation of Computer Science USA |
ICCT - Number 5 |
October 2013 |
Authors: A K Chandanan, M K Shukla |
b44adf21-0173-4d3c-a136-5ece71969484 |
A K Chandanan, M K Shukla . Overview of Redundancy free Association Rule Mining. International Conference on Communication Technology. ICCT, 5 (October 2013), 13-16.
Association rule mining is a way to find relations or co-relations among a set of information available. The aim to generate rules for giving multiple data from various databases. Analysis of data can be possible with the help of sequential access of data from database. In case of sequential access of data it may cause multiple times same rules to be generated. It is desired to find a solution to get out of those unnecessary association rules due to the complex characteristics of serial data. Although many numbers of serial association rule with the use of either sequence or temporal constraint as prediction model, these two models did not consider with the repetition during the process of rule mining for the database. The goal of this paper is to propose a method for redundancy free serial association rule mining.