Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SAC
2010
ACM

favoriteEmaildiscussreport

179views Applied Computing» more SAC 2010»

Mining interesting sets and rules in relational databases

13 years 9 months ago

Mining interesting sets and rules in relational databases

Download win.ua.ac.be

In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We deﬁne relational itemsets that contain items from several relations, and a support measure that can easily be interpreted based on the key dependencies as deﬁned in the relational scheme. We present an eﬃcient depth-ﬁrst algorithm, which mines relational itemsets directly from arbitrary relational databases. Several experiments show the practicality and usefulness of the proposed approach.

Bart Goethals, Wim Le Page, Michael Mampaey

Real-time Traffic

Applied Computing | Arbitrary Relational Databases | Mines Relational Itemsets | Relational Itemsets | SAC 2010 |

claim paper

Related Content

» SetOriented Mining for Association Rules in Relational Databases

» FARMER Finding Interesting Rule Groups in Microarray Datasets

» Mining the Most Interesting Rules

» A framework for mining interesting pattern sets

» Discovery of Spatial Association Rules in Geographic Information Databases

» Mining Association Rules from Stars

» Mining Quantitative Association Rules in Large Relational Tables

» An Efficient Data Mining Technique for Discovering Interesting Association Rules

» Mining Optimized Association Rules with Categorical and Numeric Attributes

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2010
Where	SAC
Authors	Bart Goethals, Wim Le Page, Michael Mampaey

Comments (0)