32 search results - page 1 / 7 » Mining fault-tolerant frequent patterns efficiently with pow... |
SAC
2008
ACM
13 years 4 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
AICCSA
2008
IEEE
13 years 5 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
DASFAA
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
ICDE
2006
IEEE
14 years 6 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...
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...