Sciweavers

177 search results - page 11 / 36
» Mining fault tolerant frequent patterns using pattern growth...
Sort
View
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 8 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
CIKM
2004
Springer
14 years 1 months ago
Scalable sequential pattern mining for biological sequences
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Ke Wang, Yabo Xu, Jeffrey Xu Yu
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
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...
Albert Bifet, Ricard Gavaldà
SSD
2001
Springer
218views Database» more  SSD 2001»
14 years 8 days ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 5 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki