| 基于环分布的频繁子图挖掘算法 |
| |
| 引用本文： | 董安国,高琳,邱在秦,常安定,赵建邦.基于环分布的频繁子图挖掘算法[J].工程数学学报,2009,26(6). |
| |
| 作者姓名： | 董安国 高琳 邱在秦 常安定 赵建邦 |
| |
| 作者单位： | 董安国(长安人学理学院,西安710064;西安电子科技人学计算机学院,西安710071);高琳,赵建邦(西安电子科技人学计算机学院,西安,710071);邱在秦(西安石油大学理学院,两安,710065);常安定(长安人学理学院,西安,710064) |
| |
| 基金项目： | 国家自然科学基金，陕西省自然科学计划项目，长安大学科技发展基金 |
| |
| 摘 要： | 频繁了图挖掘主要涉及到子图搜索和子图同构问题.对子图搜索问题,本文提出了环分布的概念,并构造了基于环分布的子图搜索算法:对了图同构问题,本文利用度序列和特征值构造了两种算法,分别用于对有向图和无向图的同构判别.利用同构算法对搜索出的子图进行同构分类,根据分类结果得到频繁了图.实验结果表明,本算法的效率优于现有算法.
|
| 关 键 词： | 频繁了图 子图搜索 子图南构 特征值 度序列 |
A Ring Distribution Based Algorithm for Finding Frequent Subgraphs |
| |
| DONG An-guo,GAO Lin,QIU Zai-qin,CHANG An-ding,ZHAO Jian-bang.A Ring Distribution Based Algorithm for Finding Frequent Subgraphs[J].Chinese Journal of Engineering Mathematics,2009,26(6). |
| |
| Authors: | DONG An-guo GAO Lin QIU Zai-qin CHANG An-ding ZHAO Jian-bang |
| |
| Affiliation: | DONG An-guo1,2,GAO Lin2,QIU Zai-qin3,CHANG An-ding1,ZHAO Jian-bang2(1-School of Science,ChangAn University,Xi'an 710064,2-School of Computer Science and Technology,Xidian University,Xi'an 710071,3-School of Science,Xi'an Shiyou University,Xi'an 710065) |
| |
| Abstract: | 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 a... |
| |
| Keywords: | frequent subgraph subgraph search subgraph isomorphism eigenvalue degree sequence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
