86 search results - page 11 / 18 » Efficient Vertical Mining of Frequent Closures and Generator... |
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
KBS
2002
13 years 7 months ago
2002
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead o...
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...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...