Electronic Notes in Theoretical Computer Science · 2005 · 169 citations · 10 references
ComputingChemistryData MiningData StructuresSequence AnalysisFrequent Pattern MiningGraph AlgorithmsGraph MiningSequence MiningGraph Pattern MiningSubgraph MiningSubstructure SearchSubstructure SearchingTree Search Algorithms
Given a database of graphs, structure mining algorithms search for all substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. In order to make frequent subgraph mining more efficient, we propose to search with steps of increasing complexity. We present the GrAph/Sequence/Tree extractiON (Gaston) tool that implements this idea by searching first for frequent paths, then frequent free trees and finally cyclic graphs. We give results on large molecular databases.
10
M. Kuramochi, George Karypis · 2002 · 1.1K citations · Full text
Efficient mining of frequent subgraphs in the presence of isomorphism
Jun Huan, Wei Wang, Jan F. Prins · 2004 · 617 citations
Efficiently mining frequent trees in a forest
Mohammed J. Zaki · 2002 · 467 citations