64 search results - page 2 / 13 » Frequent Subgraph Retrieval in Geometric Graph Databases |
JCP
2008
13 years 5 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
CIKM
2009
Springer
13 years 12 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
MLG
2007
Springer
13 years 11 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...
ECEASST
2006
13 years 5 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...
SIGMOD
2010
ACM
13 years 3 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...