Top-Down Algorithm for Mining Maximal Frequent Subgraph-Reference-Cited by-同舟云学术

Top-Down Algorithm for Mining Maximal Frequent Subgraph

Published:2011-02 Issue: Volume:204-210 Page:1472-1476
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Guo Jing Feng¹,Chai Ran¹,Li Jia¹

Affiliation:

1. Yanshan University

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.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.204-210.1472.pdf

Reference10 articles.

1. M. Kuramochi, G. Karypis. Frequent Subgraph Discovery, IEEE Berkeley: (2001).

2. W. Ren, Y. Zhou. FSM- A Frequent Subgraph Mining Algorithm Based on Subgraph and Structure Isomorphism, Journal of Southwest University, 2008-06(6).

3. L. Thomas, R. V. Satyanarayana. MARGIN: Maximal Frequent Subgraph Mining, New York: Springer Press, (2005).

4. Y. L. WANG, B. R. YANG, et al. A new algorithm for mining maximal frequent subgraph, Journal of System Simulation, 2008, 20 (18): 4872-4877.

5. Z. T. HU， L. F. DONG， X. WANG. A Study on the Methods of Graph-Based Data Mining, Computer Engineering, 2006, 32(3): 76-78.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generic visual data mining-based framework for revealing abnormal operation patterns in building energy systems;Automation in Construction;2021-05

2. Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2012