NDLI: Frequent Subgraph Retrieval in Geometric Graph Databases

Content Provider	IEEE Xplore Digital Library
Author	Nowozin, S. Tsuda, K.
Copyright Year	2008
Description	Author affiliation: Max Planck Inst. for Biol. Cybern., Tubingen (Nowozin, S.; Tsuda, K.)
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 epsi-subgraphs under the entire class of rigid geometric transformations in a database. By using geometric epsi-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.
Starting Page	953
Ending Page	958
File Size	584330
Page Count	6
File Format	PDF
ISBN	9780769535029
ISSN	15504786
DOI	10.1109/ICDM.2008.38
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-15
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Information retrieval Spatial databases Chemical compounds Proteins Chemistry Statistics Drugs Polynomials Geometry Pattern matching geometric patterns geometric graph mining frequent graph mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

JPMiner: Mining Frequent Jump Patterns from Graph Databases

Mining of Frequent Externally Extensible Outerplanar Graph Patterns

Frequent subgraph retrieval in geometric graph databases.

Mining lexico-syntactic patterns to extract chemical entities with their associated properties

Frequent subgraph retrieval in geometric graph databases (2008).

Clustering with lattices in the analysis of graph patterns (705).

Efficient Discovery of Frequent Correlated Subgraph Pairs

Mining Frequent Subgraph Patterns from Uncertain Graph Data

A Graph Mining Algorithm for Classifying Chemical Compounds

Frequent Subgraph Retrieval in Geometric Graph Databases

Similar Documents

JPMiner: Mining Frequent Jump Patterns from Graph Databases

Mining of Frequent Externally Extensible Outerplanar Graph Patterns

Frequent subgraph retrieval in geometric graph databases.

Mining lexico-syntactic patterns to extract chemical entities with their associated properties

Frequent subgraph retrieval in geometric graph databases (2008).

Clustering with lattices in the analysis of graph patterns (705).

Efficient Discovery of Frequent Correlated Subgraph Pairs

Mining Frequent Subgraph Patterns from Uncertain Graph Data

A Graph Mining Algorithm for Classifying Chemical Compounds

Frequent Subgraph Retrieval in Geometric Graph Databases