2000 character limit reached
Relational Association Rules: getting WARMeR
Published 15 Jun 2002 in cs.DB and cs.AI | (0206023v1)
Abstract: In recent years, the problem of association rule mining in transactional data has been well studied. We propose to extend the discovery of classical association rules to the discovery of association rules of conjunctive queries in arbitrary relational data, inspired by the WARMR algorithm, developed by Dehaspe and Toivonen, that discovers association rules over a limited set of conjunctive queries. Conjunctive query evaluation in relational databases is well understood, but still poses some great challenges when approached from a discovery viewpoint in which patterns are generated and evaluated with respect to some well defined search space and pruning operators.
Paper Prompts
Sign up for free to create and run prompts on this paper.