Discovery of Weighted Association Rules Mining

Kumar, Preetham and Ananthanarayana, V S (2010) Discovery of Weighted Association Rules Mining. In: 2nd International Conference on Computer and Automation Engineering, 26-28, December 2010.

[img] PDF
Discovery of weighted association rules mining.pdf - Published Version
Restricted to Registered users only

Download (102kB) | Request a copy

Abstract

Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai’s Algorithm

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Association , Attribute Node , Confidence, TID Node, Quantity, Weighted Minimum Support
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 31 Dec 2015 12:22
Last Modified: 31 Dec 2015 12:22
URI: http://eprints.manipal.edu/id/eprint/144980

Actions (login required)

View Item View Item