Name
Abstract | ||
|---|---|---|
Abstract In approaches to frequent graph mining that are based on growing subgraphs into a set of graphs, one of the core problems is how to avoid redundant search A powerful technique to overcome this problem is a canonical description of a graph, which uniquely identifies it, and a corresponding test This paper introduces a family of canonical forms that are based on systematic ways to construct spanning trees I show that the canonical form used in gSpan [14] is a member of this family, and that MoSS/MoFa [1, 3] is implicitly based on a di erent member, which I make explicit and exploit in the same way as in gSpan |
Year | Venue | Keywords |
|---|---|---|
2005 | Fundam. Inform. | mining graphs,canonical form,spanning tree |
Field | DocType | Volume |
Computational logic,Graph,Data structure,Text mining,Computer science,Molecule mining,Theoretical computer science,Relational algebra,Artificial intelligence,Network analysis,Rotation formalisms in three dimensions,Machine learning | Journal | 66 |
Issue | Citations | PageRank |
1-2 | 1 | 0.35 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Washio | 1 | 1775 | 190.58 |
| Luc De Raedt | 2 | 5481 | 505.49 |
| Joost N. Kok | 3 | 1429 | 121.49 |