917 search results - page 1 / 184 » Mining interesting sets and rules in relational databases |
SAC
2010
ACM
13 years 10 months ago
2010
ACM
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
ICDE
1995
IEEE
14 years 6 months ago
1995
IEEE
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
KDD
1999
ACM
13 years 9 months ago
1999
ACM
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
SIGKDD
2010
12 years 11 months ago
2010
This paper suggests a framework for mining subjectively interesting pattern sets that is based on two components: (1) the encoding of prior information in a model for the data min...