Association Rule Mining for Both Frequent and Infrequent Items Using Particle Swarm Optimization Algorithm
Journal Title: International Journal on Computer Science and Engineering - Year 2014, Vol 6, Issue 7
Abstract
In data mining research, generating frequent items from large databases is one of the important issues and the key factor for implementing association rule mining tasks. Mining infrequent items such as relationships among rare but expensive products is another demanding issue which have been shown in some recent studies. Therefore this study considers user assigned threshold values as a constraint which helps users mine those rules which are more interesting for them. In addition, in real world users may prefer to know relationships among frequent items along with infrequent ones. The particle swarm optimization algorithm is an important heuristic technique in recent years and this study uses this technique to mine association rules effectively. If this technique considers user defined threshold values, interesting association rules can be generated more efficiently. Therefore this study proposes a novel approach which includes using particle swarm optimization algorithm to mine association rules from databases. Our implementation of the search strategy includes bitmap representation of nodes in a lexicographic tree and from superset-subset relationship of the nodes it classifies frequent items along with infrequent itemsets. In addition, this approach avoids extra calculation overhead for generating frequent pattern trees and handling large memory which store the support values of candidate item sets. Our experimental results show that this approach efficiently mines association rules. It accesses a database to calculate a support value for fewer numbers of nodes to find frequent itemsets and from that it generates association rules, which dramatically reduces search time. The main aim of this proposed algorithm is to show how heuristic method works on real databases to find all the interesting association rules in an efficient way.
Authors and Affiliations
MIR MD. JAHANGIR KABIR , SHUXIANG XU , BYEONG HO KANG , ZONGYUAN ZHAO
Keywords
Related Articles
- EP ID EP126711
- DOI -
- Views 114
- Downloads 0
Recovery based Time Synchronization for Wireless Networks
Time synchronization schemes in Wireless Sensor Net- works have been subjected to various security threats and attacks. In this paper we throw light on some of these at- tacks. Nevertheless we are more concerned with the...
An Integer Programming-based Local Search for Large-scale Maximal Covering Problems
Maximal covering problem (MCP) is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integer programming requires exc...
Simultaneous Pattern and Data Clustering Using Modified K-Means Algorithm
In data mining and knowledge discovery, for finding the ignificant correlation among events Pattern discovery (PD) is used. PD typically produces an overwhelming number of patterns. Since there are too many patterns, it...
SSM-DBSCANand SSM-OPTICS : Incorporating a new similarity measure for Density based Clustering of Web usage data.
Clustering web sessions is to group web sessions based on similarity and consists of minimizing the intra-group similarity and maximizing the inter-group similarity. Here in this paper we developed a new similarity measu...
Solving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improv...