Research Article
Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure
317 downloads
@INPROCEEDINGS{10.1007/978-3-642-29157-9_38, author={Xiao Chen and Chunying Zhang and Fengchun Liu and Jingfeng Guo}, title={Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure}, proceedings={Wireless Communications and Applications. First International Conference, ICWCA 2011, Sanya, China, August 1-3, 2011, Revised Selected Papers}, proceedings_a={ICWCA}, year={2012}, month={5}, keywords={Maximal Frequent Subgraph Top-Down Graph Isomorphism Tree Structure}, doi={10.1007/978-3-642-29157-9_38} }- Xiao Chen
Chunying Zhang
Fengchun Liu
Jingfeng Guo
Year: 2012
Algorithm Research of Top-Down Mining Maximal Frequent SubGraph Based on Tree Structure
ICWCA
Springer
DOI: 10.1007/978-3-642-29157-9_38
Abstract
For the existence of problems with mining frequent subgraph by the traditional way, a new algorithm of top-down mining maximal frequent subgraph based on tree structure is proposed in this paper. In the mining process, the symmetry of graph is used to identify the symmetry vertex; determining graph isomorphism based on the attributed information of graph, the tree structure is top-down constructed and completed the calculation of support. Which is reduced the unnecessary operation and the redundant storage of graphs, and the efficiency of algorithm is improved. Experiments show that the algorithm is superior to the existing maximal frequent subgraph mining algorithms, without losing any patterns and useful information.
Copyright © 2011–2024 ICST
