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 92
- Downloads 0
Hierarchical classification of web content using Naïve Bayes approach
This paper explores the use of hierarchical structure to classify a heterogeneous collection of web pages. In the hierarchical classification, a model learns to distinguish a second level category from all other categori...
Generation of a pool of variable size symmetric keys through Image
This paper introduces a new concept of the generation of a unending pool of keys through an image leaving behind the idea of sending keys every time for encryption and decryption. This can help in avoiding the problem of...
The proposed quantum computational basis of deep ecology: its implications for agriculture
Quantum computation has been proposed to generate consciousness. The terms atman field and consciousness vector have also been used to describe the properties of consciousness. It has also been proposed that the human ac...
A Relative Study on Retinal Vessel Segmentation
Retinal image processing is a standard medical repetition and offers number of profitable products for physicians. In the field of retinal image processing retinal vessel segmentation is the crucial task for detection of...
Rebroadcasting for Routing Reduction based upon Neighbor coverage in Ad Hoc Networks
Cause of nodes high mobility in mobile ad hoc networks (MANETs), there are frequent link breakages exist which escort to frequent route discoveries and path failures. The route discovery procedure cannot be ignored. In a...