Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism

  • Authors:
  • Jun Huan;Wei Wang;Jan Prins

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Frequent subgraph mining is an active research topic inthe data mining community. A graph is a general modelto represent data and has been used in many domains likecheminformatics and bioinformatics. Mining patterns fromgraph databases is challenging since graph related operations,such as subgraph testing, generally have higher timecomplexity than the corresponding operations on itemsets,sequences, and trees, which have been studied extensively.In this paper, we propose a novel frequent subgraph miningalgorithm: FFSM, which employs a vertical search schemewithin an algebraic graph framework we have developedto reduce the number of redundant candidates proposed.Our empirical study on synthetic and real datasets demonstratesthat FFSM achieves a substantial performance gainover the current start-of-the-art subgraph mining algorithmgSpan.