42 search results - page 3 / 9 » An Efficient Heuristic Search for Real-Time Frequent Pattern... |
AICCSA
2008
IEEE
13 years 7 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...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
DIS
2004
Springer
13 years 11 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...