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 120
- Downloads 0
A Novel Algorithm for Scaling up the Accuracy of Decision Trees
Classification is one of the most efficient and widely used data mining technique. In classification, Decision trees can handle high dimensional data, and their representation is intuitive and generally easy to assimilat...
A Survey of Denial of Service Attacks and it’s Countermeasures on Wireless Network
Wireless networks are popular among the Laptop user community today because of the mobility and ease of use. People working through wireless connection must be aware of the surroundings due to the various types of attack...
Web Miner: A Tool for Discovery of Usage Patterns From Web Data
As there is a huge amount of data available online, the World Wide Web is a fertile area for data mining research. In recent years a various surveys have been performed on static data of web sites to perform web usage mi...
Global Intelligent Sensor Networking System
New media, new data type and ubiquitous access to high speed real time network applications are revolutionizing the whole Universe. In many critical applications, human performance is often a high risk element in the ove...
Analysis on Image Processing of Human Hip Joints during Lifting Using MAT Lab and ANSYS
Human Joint paints exhibit abnormal motion and vise versa during movements. Most of the patients were suffering from joint paints. This joint paints like Hip joints, Knee joints, Foot joints, Shoulder joints Elbow joints...