583 search results - page 65 / 117 » Mining evolving data streams for frequent patterns |
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...
114
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
107
click to vote
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
CORR
2011
Springer
14 years 1 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...