214 search results - page 21 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
DAWAK
2000
Springer
14 years 23 days ago
2000
Springer
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
KDD
2007
ACM
14 years 2 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...