Computer Science ›› 2005, Vol. 32 ›› Issue (10): 193-196.
Previous Articles Next Articles
Online:
Published:
Abstract: This paper provides a survey of the study in frequent subgraph mining, brings forward a classification of frequent subgraph mining, reviews and analyses some typical algorithms, conclude the general steps on finding frequent subgraphs in graph database an
Key words: Association rule, Labeled graph, Canonical code, Subgraph isomorphism
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2005/V32/I10/193
Cited