302 search results - page 26 / 61 » Efficient frequent pattern mining over data streams |
167
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, webclick st...
KDD
2002
ACM
15 years 10 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 ...
89
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
170
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
99
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...