Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

Voted

ICDM
2008
IEEE

127views Data Mining» more ICDM 2008»

Frequent Subgraph Retrieval in Geometric Graph Databases

15 years 9 months ago

Frequent Subgraph Retrieval in Geometric Graph Databases

Download www.kyb.mpg.de

Sebastian Nowozin, Koji Tsuda

Real-time Traffic

Data Mining | ICDM 2008 |

claim paper

Related Content

» Discovering frequent geometric subgraphs

» Indexing and mining topological patterns for drug discovery

» SPIN mining maximal frequent subgraphs from graph databases

» Summarization Graph Indexing Beyond Frequent StructureBased Approach

» Mining Frequent Subgraph by Incidence Matrix Normalization

» Frequent subgraph pattern mining on uncertain graph data

» Support Computation for Mining Frequent Subgraphs in a Single Graph

» The ParMol Package for Frequent Subgraph Mining

» GBLENDER towards blending visual query formulation and query processing in graph databases

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICDM
Authors	Sebastian Nowozin, Koji Tsuda

Comments (0)