CS 68191 Masters Seminar / CS 89191 Doctoral Seminar
Spring 2007
Doctoral Student Presentation
Frequent Subgraph Mining
Mike Yuan
It is very important to find frequent subgraphs in a graph because
they have many applications, e.g., protein interaction, etc. This
paper gives a survey of different frequent subgraph mining algorithms:
AGM: Inokuchi, et al. (PKDD'00), FSG: Kuramochi and Karypis (ICDM'01),
FFSM: Huan, et al. (ICDM'03), gSpan: Yan and Han (ICDM'02), and
NemoFinder: J.Chen, et al. (SIGKDD'06), etc.