387 search results - page 13 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
RSCTC
2004
Springer
14 years 1 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
Contrast sets have been shown to be a useful tool for describing differences between groups. A contrast set is a set of association rules for which the antecedents describe distin...
PKDD
1999
Springer
13 years 12 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...