Top-Down Algorithm for Mining Maximal Frequent Subgraph

Abstract

In order to solution the problem of mining maximal frequent subgraph is very hard we proposed new algorithm Top-Down. The process of this algorithm is using decision tree to count support then firstly judge the biggest graph whether frequent and gradually reduce the graph which used to judge until can not mining maximal frequent subgraph, at the same time this algorithm is proposed a theorem and two principles these are improved the mining efficiency.