Top-Down Algorithm for Mining Maximal Frequent Subgraph

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 204-210)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1472-1476

DOI:

10.4028/www.scientific.net/AMR.204-210.1472

Citation:

J. F. Guo et al., "Top-Down Algorithm for Mining Maximal Frequent Subgraph", Advanced Materials Research, Vols. 204-210, pp. 1472-1476, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.