Frequent Subgraph Mining

Brent E. Harrison, Jason C. Smith, Stephen G. Ware, Hsiao Wei Chen, Wenbin Chen, Anjali Khatri

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations


Frequent Subgraph Mining (FSM) is the process of discovering subgraphs that occur often in a database of other graphs. In this context, often means that the graph in question occurs more than some arbitrary threshold number of times.

Original languageEnglish
Title of host publicationPractical Graph Mining with R
Number of pages38
ISBN (Electronic)9781439860854
StatePublished - Jan 1 2013

Bibliographical note

Publisher Copyright:
© 2014 by Taylor and Francis Group, LLC.

ASJC Scopus subject areas

  • Economics, Econometrics and Finance (all)
  • Business, Management and Accounting (all)
  • Computer Science (all)


Dive into the research topics of 'Frequent Subgraph Mining'. Together they form a unique fingerprint.

Cite this