ACM Home Page
Please provide us with feedback. Feedback
Weighted Association Rule Mining using weighted support and significance framework
Full text PdfPdf (213 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Washington, D.C.
POSTER SESSION: Research track table of contents
Pages: 661 - 666  
Year of Publication: 2003
ISBN:1-58113-737-0
Authors
Feng Tao  University of Southampton, Southampton, UK
Fionn Murtagh  Queen's University Belfast, Belfast, UK
Mohsen Farid  Queen's University Belfast, Belfast, UK
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 126,   Citation Count: 18
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/956750.956836
What is a DOI?

ABSTRACT

We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to have a weight. The goal is to steer the mining focus to those significant relationships involving items with significant weights rather than being flooded in the combinatornal explosion of insignificant relationships. We identify the challenge of using weights in the iterative process of generating large itemsets. The problem of invalidation of the "downward closure property" in the weighted setting is solved by using an improved model of weighted support measurements and exploiting a "weighted downward closure property". A new algorithm called WARM (Weighted Association Rule Mining) is developed based on the improved model. The algorithm is both scalable and efficient in discovering significant relationships in weighted settings as illustrated by experiments performed on simulated datasets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Agrawal et al, "The Quest Data Mining System" Technical report, IBM Almaden Research Center, http://www.almaden.ibm.com/cs/quest/, 1996.
2
 
3
 
4
5
 
6
 
7
8
 
9
 
10
G. D. Ramkumar, Sanjay Ranka, and Shalom Tsur, "Weighted Association Rules: Model and Algorithm" KDD1998, 1998.
 
11
Feng Tao, "Mining Binary Relationships from Transaction Data in Weighted Settings" PhD Thesis, School of Computer Science, Queen's University Belfast, UK, 2003.
12

CITED BY  18

Collaborative Colleagues:
Feng Tao: colleagues
Fionn Murtagh: colleagues
Mohsen Farid: colleagues