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