739 search results - page 15 / 148 » Approximate Association Rule Mining |
PAKDD
2004
ACM
15 years 3 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...
103
Voted
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
FLAIRS
2007
14 years 12 months ago
2007
This paper presents a numerical association rule extraction method that is based on original quality measures which evaluate to what extent a numerical classification model behave...
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...