32 search results - page 4 / 7 » Mining fault-tolerant frequent patterns efficiently with pow... |
89
Voted
KDD
2002
ACM
15 years 9 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
KDD
2008
ACM
15 years 9 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
ISCI
2008
14 years 9 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
DMIN
2006
14 years 10 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...