| 基于图的数据挖掘算法研究 |
| |
| 引用本文： | 唐德权,夏幼明,张丽英.基于图的数据挖掘算法研究[J].云南师范大学学报(自然科学版),2007,27(5):30-34. |
| |
| 作者姓名： | 唐德权 夏幼明 张丽英 |
| |
| 作者单位： | 1. 湖南公安高等专科学校计算机系,湖南,长沙,410138
2. 云南师范大学计算机科学与信息技术学院,云南,昆明,650092 |
| |
| 基金项目： | 云南省教育厅自然科学基金(5J0621D)，云南省自然科学基金项目(03F0038M) |
| |
| 摘 要： | 对图数据频繁模式的挖掘是近年的研究热点,而从图数据库中挖掘频繁模式的关键是子图测试和候选子图生成操作。与传统广泛研究的频繁项集、频繁序列、频繁子树挖掘相比较,频繁子图的挖掘更复杂、更有难度,因为图同构问题是一个NP-完全问题。因此,必须有个好的规范化编码和有效的算法来避免子图同构这个难题。
|
| 关 键 词： | 数据挖掘 子图同构 规范化编码 |
| 文章编号： | 1007-9793（2007）05-0030-05 |
| 修稿时间： | 2006-12-13 |
Research on a algorithm of based- graph data mining |
| |
| Tang De-Quan,Xia You-Ming,Zhang Li-Ying.Research on a algorithm of based- graph data mining[J].Journal of Yunnan Normal University (Natural Sciences Edition),2007,27(5):30-34. |
| |
| Authors: | Tang De-Quan Xia You-Ming Zhang Li-Ying |
| |
| Institution: | 1. Computer.Science department,HuNan Public Security college, Changsha HuNan 410138; 2. College of Computer Science and Information tehnology, YunNan Nonrmal University, Kunming YunNan 650092 |
| |
| Abstract: | Mining frequent patterns from graph databases is an active research topic in the data mining community.Frequent subgraph mining is challenging since graph related operations,such as subgraph testing,generally have higher time complexity than the corresponding operations on itemsets,sequences,and trees,Which have been studied estensively.Subgraph isomorphism is NP-Complete problem.So must avoiding subgrph isomorphism by canonical code and efficient algorithm. |
| |
| Keywords: | data mining subgraph isomrphism canonical code |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
