64 search results - page 3 / 13 » Frequent Subgraph Retrieval in Geometric Graph Databases |
ICDE
2006
IEEE
14 years 7 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...
KDD
2006
ACM
14 years 6 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...
PKDD
2010
Springer
13 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
ICDM
2006
IEEE
14 years 9 days ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...