155 search results - page 6 / 31 » A parallel, distributed algorithm for relational frequent pa... |
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
FUIN
2008
13 years 7 months ago
2008
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
BMCBI
2007
13 years 7 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...
JIIS
2010
13 years 2 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...