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 109
- Downloads 0
Reconfigurable Computing Systems Used To Support Next Generation High Speed Applications
Emerging dimensions of scientific computing have changed the structural requirements of the under laying hardware and software resources. The growing scientific applications are demanding for the high speed computing pla...
Facial Expression Recognition
Facial expression analysis is rapidly becoming an area of ntense interest in computer science and human-computer interaction design communities. The most expressive way humans display emotions is through facial expressi...
COMPONENT-BASED HETEROGENEOUS SOFTWARE RCHITECTURE RELIABILITY (COHAR) MODELING
In this paper, we propose an analytical model for mponent-based heterogeneous software architecture reliability and a method to find the solution for finding the optimal eliability of the overall software system accor...
An Improved Hop-Count Metric for Infrastructural Wireless Mesh Network
Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. In a WMN...
A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES
Generation and prioritization of test cases is one of the major issue in software testing.Maximum number of faults are identified through test cases only. Clients confidence can be gained through software testing. This p...