English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Frequent Subgraph Retrieval in Geometric Graph Databases

Nowozin, S., & Tsuda, K. (2008). Frequent Subgraph Retrieval in Geometric Graph Databases. In F. Giannotti, D. Gunopulos, F. Turini, C. Zaniolo, N. Ramakrishnan, & X. Wu (Eds.), 2008 Eighth IEEE International Conference on Data Mining (pp. 953-958). Piscataway, NJ, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C62F-F Version Permalink: https://hdl.handle.net/21.11116/0000-0003-3793-9
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4781207 (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Nowozin, S1, 2, Author           
Tsuda, K1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: Discovery of knowledge from geometric graph databases is of particular importance in chemistry and biology, because chemical compounds and proteins are represented as graphs with 3D geometric coordinates. In such applications, scientists are not interested in the statistics of the whole database. Instead they need information about a novel drug candidate or protein at hand, represented as a query graph. We propose a polynomial-delay algorithm for geometric frequent subgraph retrieval. It enumerates all subgraphs of a single given query graph which are frequent geometric epsilon-subgraphs under the entire class of rigid geometric transformations in a database. By using geometricepsilon-subgraphs, we achieve tolerance against variations in geometry. We compare the proposed algorithm to gSpan on chemical compound data, and we show that for a given minimum support the total number of frequent patterns is substantially limited by requiring geometric matching. Although the computation time per pattern is lar
ger than for non-geometric graph mining,the total time is within a reasonable level even for small minimum support.

Details

show
hide
Language(s):
 Dates: 2008-12
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1109/ICDM.2008.38
BibTex Citekey: 5521
 Degree: -

Event

show
hide
Title: Eighth IEEE International Conference on Data Mining (ICDM 2008)
Place of Event: Pisa, Italy
Start-/End Date: 2008-12-15 - 2008-12-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: 2008 Eighth IEEE International Conference on Data Mining
Source Genre: Proceedings
 Creator(s):
Giannotti, F, Editor
Gunopulos, D, Editor
Turini, F, Editor
Zaniolo, C, Editor
Ramakrishnan, N, Editor
Wu, X, Editor
Affiliations:
-
Publ. Info: Piscataway, NJ, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 953 - 958 Identifier: ISBN: 978-0-7695-3502-9