Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
click to vote
ICDM
2008
IEEE
favorite
Email
discuss
report
127
views
Data Mining
»
more
ICDM 2008
»
Frequent Subgraph Retrieval in Geometric Graph Databases
14 years 1 months ago
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
more »
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)
Researcher Info
Data Mining Study Group
Computer Vision