376 search results - page 16 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
BMCBI
2007
13 years 8 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
KDD
2006
ACM
14 years 9 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
14 years 6 days 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...
APWEB
2006
Springer
14 years 6 days ago
2006
Springer
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...