欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
频繁子图挖掘主要涉及到子图搜索和子图同构问题。对子图搜索问题,本文提出了环分布的概念,并构造了基于环分布的子图搜索算法;对子图同构问题,本文利用度序列和特征值构造了两种算法,分别用于对有向图和无向图的同构判别。利用同构算法对搜索出的子图进行同构分类,根据分类结果得到频繁子图。实验结果表明,本算法的效率优于现有算法。
英文摘要：
Frequent subgraph mining includes subgraph search and isomorphism problems. For the subgraph searching, we propose the definition of a ring distribution and provide a novel subgraph search algorithm based on the ring distribution. Furthermore, by using the degree sequence and eigenvalue, we present two algorithms for subgraph isomorphism in directed and undirected graphs, respectively. Finally, we experimentally evaluate the performance of our algorithms by using real networks. The simulation results show that our algorithm is more effective than existing algorithms.
位置：
同期刊论文项目
