Mining association rules with item constraints
1997
767 citations
The problem of discovering association rules has re-ceived considerable research attention and several fast algorithms for mining association rules have been de-veloped. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a specific item or rules that contain children of a specific item in a hierar-chy. While such constraints can be applied as a post-processing step, integrating them into the mining algo-rithm can dramatically reduce the execution time. We consider the problem of integrating constraints that n..,, l.....l,....,....,,....:,,,-1.~.. cl.,-..s..a..-m e....l.“,“, CUG Y”“Ac;Qu GnpLz:I)DIVua “YGI “Us: pGYaLcG “I OLJDciliLG of items into the association discovery algorithm. We present three integrated algorithms for mining asso-ciation rules with item constraints and discuss their tradeoffs. 1.
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates a...
In the 50 United States and the District of Columbia law enforcement medical referrals are accepted by licensing agencies. This study assessed driving actions, medical concerns,...
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpos...