112 search results - page 4 / 23 » Efficient Approximate Mining of Frequent Patterns over Trans... |
KDD
2008
ACM
14 years 6 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
AUSDM
2008
Springer
13 years 7 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
AUSDM
2007
Springer
13 years 12 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...
ICDM
2006
IEEE
13 years 12 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
ICDM
2006
IEEE
13 years 12 months ago
2006
IEEE
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...