24 search results - page 1 / 5 » pakdd 2004 |
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...