|
|||||
|
|
| 基于图谱归一化编辑距离的聚类算法 | |
| 引用本文： | 孔敏,方杰,罗斌.基于图谱归一化编辑距离的聚类算法[J].皖西学院学报,2007,23(5):13-16. |
| 作者姓名： | 孔敏 方杰 罗斌 |
| 作者单位： | 1. 皖西学院,机械与电子工程系,安徽,六安,237012;安徽大学,计算机科学与技术学院,安徽,合肥,230039 2. 皖西学院,机械与电子工程系,安徽,六安,237012 3. 安徽大学,计算机科学与技术学院,安徽,合肥,230039 |
| 基金项目： | 安徽省教育厅自然科学基金;皖西学院校科研和教改项目 |
| 摘 要： | 图之间的距离度量一直是研究的难点之一。文中提出了一种基于图谱归一化编辑距离的聚类方法。首先利用图的谱方法实现图中点的排序,再用串编辑距离进行两图之间的相似性度量,以此距离构成的不相似矩阵,应用基于矩阵理论的聚类算法实现序列图的聚类研究。考虑到图中点的多少差异,给出归一化串编辑距离的方法解决长短谱序列间距离差异误差问题。实验表明,基于图谱归一化编辑距离的聚类方法是有效的。 |
| 关 键 词： | 算法 谱聚类 图谱编辑距离 图的谱 |
| 文章编号： | 1009-9735（2007）05-0013-04 |
| 修稿时间： | 2007-08-30 |
Clustering Algorithm Based on Normalized Edit Distance of Graph Spectra |
|
| KONG Min,FANG Jie,LUO Bin.Clustering Algorithm Based on Normalized Edit Distance of Graph Spectra[J].Journal of Wanxi University,2007,23(5):13-16. | |
| Authors: | KONG Min FANG Jie LUO Bin |
| Abstract: | Distance metric between graphs is a difficult issue. A clustering method based on spectral normalized edit distance is proposed.Firstly vertices in graphs are sorted by graph spectra.them similarity metric between graphs is defined based on string edit distance,a dissimilarity matrix is constructed by these distances and clustering of sequence graph is realized by matrix theory.Due to the number variation of vertices between graphs,normalized string edit distance is proposed to solve the distance variation between graphs with different length of spectra.Experiments show that the clustering based on normalized edit distance of spectra is feasible. |
| Keywords: | algorithm spectral clustering spectral edit distance of graphs graph spectra |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |