Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/702
Title: | Relational Association Rules: Getting WARM eR | Authors: | GOETHALS, Bart VAN DEN BUSSCHE, Jan |
Issue Date: | 2002 | Publisher: | Springer-Verlag | Source: | Pattern Detection and Discovery: ESF Exploratory Workshop. p. 125-139 | Series/Report: | Lecture Notes in Computer Science | Series/Report no.: | 2447 | 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. | Document URI: | http://hdl.handle.net/1942/702 | ISSN: | 0302-9743 | Category: | A1 | Type: | Journal Contribution |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
datamining3.pdf | 163.21 kB | Adobe PDF | View/Open |
Page view(s)
68
checked on Nov 7, 2023
Download(s)
126
checked on Nov 7, 2023
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.