FOG: mining Frequent Outerplanar Graphs
General
FOG is a data mining system for finding frequent outerplanar graphs.
Outerplanar graphs are graphs that can be embedded in the plane without edges crossing in such a way that all points can be reached from the outside.
FOG is implemented by Jan Ramon based on theory jointly developed with Tamas Horvath.
Download
To obtain the FOG system and the benchmark datasets used
in the papers, please contact Jan Ramon (Jan dot Ramon at cs dot kuleuven
dot be).
References
The following papers describe the theory of mining outerplanar graphs and experiments performed with FOG.
- Tamas Horvath, Jan Ramon, Stefan Wrobel, Frequent Subgraph Mining in Outerplanar Graphs, accepted for KDD2006
- Download PDF
- This paper uses the biconnected component - bridge representation, use -bcbr=1
- Tamas Horvath, Jan Ramon, Stefan Wrobel, Frequent Subgraph Mining in Outerplanar Graphs, accepted for MLG2006
- Download PDF
- A short version of the KDD paper.
- Jan Ramon, Tamas Horvath, Leander Schietgat, Stefan Wrobel.
FOG: Finding Outerplanar Graphs. Proposal for the KDD Demo session 2006
- Download: PDF
- A short description of a demo of the FOG system.
Please email any questions, comments or bug reports to Jan.Ramon at cs.kuleuven.be