Improving Frequent Subgraph Mining in the Presence of Symmetry.
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz · PolyPublie (École Polytechnique de Montréal) · 2007
The difficulty of the frequent subgraph mining problem arises from the tasks of enumerating the subgraphs and calculating their support in the dataset. If the dataset graphs have additional information in