59 search results - page 3 / 12 » Frequent subgraph mining in outerplanar graphs |
MLG
2007
Springer
14 years 1 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
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...
ECEASST
2006
13 years 7 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
ICDM
2006
IEEE
14 years 1 months 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...
PKDD
2004
Springer
14 years 10 days ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...