1217 search results - page 18 / 244 » On compressing frequent patterns |
138
Voted
ACMSE
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
257
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
139
click to vote
JDWM
2010
15 years 1 months ago
2010
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
112
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
107
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....