| 逐步最佑扩展的频繁子图挖掘算法 |
| |
| 引用本文： | 张俊峰,周焱,薛冰,刘荣辉.逐步最佑扩展的频繁子图挖掘算法[J].河南科技大学学报(自然科学版),2011,32(1):41-44,48,118,119. |
| |
| 作者姓名： | 张俊峰 周焱 薛冰 刘荣辉 |
| |
| 作者单位： | 1. 河南城建学院,计算机科学与工程系,河南,平顶山,467036
2. 河南城建学院,计算机科学与工程系,河南,平顶山,467036;东华大学,管理学院,上海,200051 |
| |
| 基金项目： | 国家自然科学基金项目(70971020); 河南省重点科技攻关项目(092102210251) |
| |
| 摘 要： | gSpan算法是一种高效的频繁子图挖掘算法,它通过最右扩展图的标准编码得到图集中的所有频繁子图,但它需要通过子图同构判断来计算支持度,由于子图同构问题是NP完全问题,其计算比较复杂.针对上述问题提出一种优化的算法IgSpan,通过改进的ADI++存储结构将图的最右扩展和支持度的计算相结合,避免直接的子图同构判断,经实验...
|
| 关 键 词： | 频繁子图 子图同构 标准编码 |
Frequent Subgraph Mining Algorithm of Gradually Right-most Extension |
| |
| ZHANG Jun-Feng,ZHOU Yan,XUE-Bing,LIU Rong-Hui.Frequent Subgraph Mining Algorithm of Gradually Right-most Extension[J].Journal of Henan University of Science & Technology:Natural Science,2011,32(1):41-44,48,118,119. |
| |
| Authors: | ZHANG Jun-Feng ZHOU Yan XUE-Bing LIU Rong-Hui |
| |
| Institution: | ZHANG Jun-Feng1,ZHOU Yan1,XUE-Bing1,LIU Rong-Hui1,2 (1.Department of Computer Science & Engineering,Henan University of Urban Construction,Pingdingshan 467036,China,2.School of Management,Donghua University,Shanghai 200051,China) |
| |
| Abstract: | The gSpan algorithm has a better efficiency in the implementation as an efficient algorithm for frequent subgraph mining.It uses right-most extension to mine frequent subgraph.But it calculates the support of subgraph by subgraph isomorphism which is a NP complete problem and the calculation is complex.A new algorithm IgSpan was proposed,which could avoid subgraph isomorphism by using improved ADI++ storage structure to combine the expanded subgraph with the calculation of support.Experiments show that the ... |
| |
| Keywords: | Frequent subgraph Subgraph isomorphism Canonical code |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
