302 search results - page 9 / 61 » Efficient frequent pattern mining over data streams |
118
click to vote
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
116
click to vote
DAMON
2008
Springer
14 years 11 months ago
2008
Springer
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
106
click to vote
DATAMINE
2006
14 years 9 months ago
2006
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...