Published May 3, 2006 | https://doi.org/10.59350/r4sw4-ehh35

Four graph mining methods integrated in ParMol

Creators & Contributors

  • 1. ROR icon University of Cologne

Joerg Wegner mentioned in his blog the graph mining program ParMol which integrates four mining algorithms: MoSS (aka MoFa) and Gaston, which I mentioned in November last year , and FFSM and gSpan, which I did not know about yet. ParMol provides a common interface to the four different algorithms and is, like the four mining modules, licensed GPL. An interesting aspect is that Gaston was originally written in C++.

Additional details

Description

Joerg Wegner mentioned in his blog the graph mining program ParMol which integrates four mining algorithms: MoSS (aka MoFa) and Gaston, which I mentioned in November last year , and FFSM and gSpan, which I did not know about yet. ParMol provides a common interface to the four different algorithms and is, like the four mining modules, licensed GPL. An interesting aspect is that Gaston was originally written in C++.

Dates

Issued
2006-05-03T02:00:00
Updated
2025-02-16T01:00:00