Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism

@inproceedings{Huan2003EfficientMO,
  title={Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism},
  author={Jun Huan and Wei Wang and Jan Prins},
  booktitle={ICDM},
  year={2003}
}
Frequent subgraph mining is an active research topic in the data mining community. A graph is a general model to represent data and has been used in many domains like cheminformatics and bioinformatics. Mining patterns from graph databases is challenging since graph related operations, such as subgraph testing, generally have higher time complexity than the corresponding operations on itemsets, sequences, and trees, which have been studied extensively. In this paper, we propose a novel frequent… CONTINUE READING
Highly Influential
This paper has highly influenced 47 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 753 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 402 extracted citations

754 Citations

0204060'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 754 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Finding frequent substructures in chemical componuds

  • D. Suciu
  • Proc . of the 4 th International Conference on…
  • 1998

Substruc - tures discovery in the subdue system

  • S. Djoko
  • Proc . AAAI ’ 94 Workshop Knowledge Discovery in…
  • 1997

An aprioribased algorithm for mining frequent substructures from graph data

  • G. Karypis, K. Shearer, H. Bunks, S. Venkatesh

Efficient mining of frequent subgraph in the presence of isomorphism

  • T. Washio A. Inokuchi, H. Motoda
  • UNC computer science technique report TR

Similar Papers

Loading similar papers…