124 search results - page 11 / 25 » Quantitative evaluation of approximate frequent pattern mini... |
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
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...
AUSDM
2007
Springer
15 years 4 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...