EFFICIENT MINING OF WEIGHTED QUANTITATIVE ASSOCIATION RULES AND CHARACTERIZATION OF FREQUENT ITEMSETS
Journal Title: International Journal on Computer Science and Engineering - Year 2014, Vol 6, Issue 1
Abstract
In recent years, a number of association rule mining algorithms were developed. In these algorithms, two important measures viz., support count and confidence were used to generate the frequent itemsets and the corresponding association rules in a market basket database. But in reality, these two measures are not sufficient for efficient and effective target marketing. In this paper, a weighted frame work has been discussed by taking into account the weight / intensity of the item and the quantity of each item in each transaction of the given database. Apriori algorithm is one of the best algorithm to generate frequent itemsets, but it does not consider the weight as well as the quantity of items in the transactions of the database. This paper consists of two phases. In the first phase, we propose an algorithm Apriori-WQ, which extends the Apriori algorithm by incorporating the weight and quantity measures and generates Weighted Frequent Itemsets (WFI) and corresponding Weighted Association Rules (WAR). The rules are filtered based on a new measure called Minimum Weight Threshold (MWT), and then prioritized. Some itemsets may not be frequent but they satisfy MWT. Such sets are also generated. In the second phase we analyze the transactions {Ti}, which form the frequent itemsets and the customer characteristics (i.e., attributes) of those transactions {Ti}. Experiments are performed to establish a relationship between frequent itemsets and customer characteristics. 3D-graphical reports are generated, which helps the marketing leaders for making better predictions and planning their investment and marketing strategies.
Authors and Affiliations
Arumugam G , Vijayakumar V. K
Keywords
Related Articles
- EP ID EP126097
- DOI -
- Views 78
- Downloads 0
Efficient Parallel Data Processing in the Cloud
Cloud computing is a distributed computing technology which is the combination of hardware and software and delivered as a service to store, manage and process data. A new system is proposed to allocate resources dynamic...
Determination of Angry Condition based on EEG, Speech and Heartbeat
This paper determines the angry emotion condition by analyzing and recognizing speech signal, EEG signal, as well as detecting the heartbeat. For the speech analyzing experiment, several digital signal processing methods...
A Service Oriented Architecture to Integrate Short Message Service (SMS) Notification in Road Traffic Volume Control System
The traffic volume becomes one of the top problems in the world, the volume of traffic spends many time and much money, the traffic volume grows daily, and there is not effective and suitable solutions for grows problem....
Deriving Association between Urban and Rural Students Programming Skills
Data mining is used to extract the interesting patterns from databases or repositories. Frequent Pattern Tree is a technique for discovering association between the variables and finds the frequent patterns in the Studen...
An Analysis on Preservation of Privacy in Data Mining
Privacy has become a key issue for progress in data mining. Maintaining the privacy of data mining has become ncreasingly popular because it allows sharing of privacy-sensitive data for analysis. So people are still rel...