Canonical Forms for Frequent Graph Mining

  • Christian Borgelt
Conference paper

DOI: 10.1007/978-3-540-70981-7_38

Part of the book series Studies in Classification, Data Analysis, and Knowledge Organization (STUDIES CLASS)
Cite this paper as:
Borgelt C. (2007) Canonical Forms for Frequent Graph Mining. In: Decker R., Lenz H.J. (eds) Advances in Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg

Abstract

A core problem of approaches to frequent graph mining, which are based on growing subgraphs into a set of graphs, is how to avoid redundant search. A powerful technique for this is a canonical description of a graph, which uniquely identifies it, and a corresponding test. I introduce a family of canonical forms based on systematic ways to construct spanning trees. I show that the canonical form used in gSpan ([Yan and Han (2002)]) is a member of this family, and that MoSS/MoFa ([Borgelt and Berthold (2002), Borgelt et al. (2005)]) is implicitly based on a different member, which I make explicit and exploit in the same way.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Christian Borgelt
    • 1
  1. 1.European Center for Soft ComputingMieresSpain