69 search results - page 7 / 14 » Efficient Runtime Generation of Association Rules |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
BMCBI
2010
13 years 7 months ago
2010
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
KDD
1999
ACM
13 years 11 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
DAWAK
2010
Springer
13 years 8 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...