DMCA
Mining Generalized Association Rules (1995)
Cached
Download Links
- [140.115.82.191]
- [www.cs.uiuc.edu]
- [almaden.ibm.com]
- [www.almaden.ibm.com]
- [rakesh.agrawal-family.com]
- [www.rakesh.agrawal-family.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 590 - 7 self |
BibTeX
@INPROCEEDINGS{Srikant95mininggeneralized,
author = {Ramakrishnan Srikant and Rakesh Agrawal},
title = {Mining Generalized Association Rules},
booktitle = {},
year = {1995},
pages = {407--419}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy that says that jackets is-a outerwear is-a clothes, we may infer a rule that "people who buy outerwear tend to buy shoes". This rule may hold even if rules that "people who buy jackets tend to buy shoes", and "people who buy clothes tend to buy shoes" do not hold. An obvious solution to the problem is to add all ancestors of each item in a transaction to the transaction, and then run any of the algorithms for mining association rules on these "extended transactions ". However, this "Basic" algorithm is not very fast; we present two algorithms, Cumulate and EstMerge, which run 2 to 5 times faster than Basic (and more than 100 times faster on one real-life dataset). We also present a new interes...
