The Gaston Tool for Frequent Subgraph Mining | Zendy

Siegfried Nijssen | Zendy; Joost N. Kok | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Gaston Tool for Frequent Subgraph Mining

Author(s) -

Siegfried Nijssen,

Joost N. Kok

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.12.039

Subject(s) - computer science , search tree , graph , induced subgraph isomorphism problem , subgraph isomorphism problem , distance hereditary graph , theoretical computer science , tree (set theory) , sequence (biology) , data mining , search algorithm , combinatorics , mathematics , algorithm , line graph , voltage graph , biology , genetics

Given a database of graphs, structure mining algorithms search for all substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. In order to make frequent subgraph mining more efficient, we propose to search with steps of increasing complexity. We present the GrAph/Sequence/Tree extractiON (Gaston) tool that implements this idea by searching first for frequent paths, then frequent free trees and finally cyclic graphs. We give results on large molecular databases

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research