Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Frequent Subgraph Retrieval in Geometric Graph Databases

Nowozin, S., & Tsuda, K.(2008). Frequent Subgraph Retrieval in Geometric Graph Databases (180). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C66F-0 Versions-Permalink: https://hdl.handle.net/21.11116/0000-0002-86FF-8
Genre: Bericht

Dateien

einblenden: Dateien
ausblenden: Dateien
:
MPIK-TR-180.pdf (Verlagsversion), 707KB
Öffnen   Speichern
Datei-Permalink:
https://hdl.handle.net/21.11116/0000-0002-86FE-9
Name:
MPIK-TR-180.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Öffnen
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Nowozin, S1, 2, Autor           
Tsuda, K1, 2, Autor           
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              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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 geometric epsilon-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 larger than for non-geometric graph mining, the total time is within a reasonable level even for small
minimum support.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2008-11
 Publikationsstatus: Erschienen
 Seiten: 13
 Ort, Verlag, Ausgabe: Tübingen, Germany : Max Planck Institute for Biological Cybernetics
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: Reportnr.: 180
BibTex Citekey: 5616
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Technical Report of the Max Planck Institute for Biological Cybernetics
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 180 Artikelnummer: - Start- / Endseite: - Identifikator: -