873 search results - page 27 / 175 » Reducing the Frequent Pattern Set |
112
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
128
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
127
click to vote
TKDE
2008
15 years 25 days ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
WISE
2006
Springer
15 years 7 months ago
2006
Springer
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
122
click to vote
JIIS
2008
15 years 27 days ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...