We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/The Gaston Tool for Frequent Subgraph Mining
PeriodicalsComputer Science & Information Technology

The Gaston Tool for Frequent Subgraph Mining

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Siegfried Nijssen, Joost N. Kok (2005). The Gaston Tool for Frequent Subgraph Mining. Electronic Notes in Theoretical Computer Science, 127(1), 77–87. https://doi.org/10.1016/j.entcs.2004.12.039

Copy in another style

Nijssen, S., & Kok, J. N. (2005). The Gaston Tool for Frequent Subgraph Mining. Electronic Notes in Theoretical Computer Science, 127(1), 77–87. https://doi.org/10.1016/j.entcs.2004.12.039
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.