| 注册
首页|期刊导航|计算机应用研究|基于边映射表连接的匹配算法

基于边映射表连接的匹配算法

曹春萍 何佳

计算机应用研究2013,Vol.30Issue(9):2697-2699,2703,4.
计算机应用研究2013,Vol.30Issue(9):2697-2699,2703,4.DOI:10.3969/j.issn.1001-3695.2013.09.034

基于边映射表连接的匹配算法

Graph matching algorithm based on edge map's connection

曹春萍 1何佳1

作者信息

  • 1. 上海理工大学光电信息与计算机工程学院,上海200093
  • 折叠

摘要

Abstract

Aiming at the semantic network graph matching problem's particularity,this paper proposed a new matching algorithm based on the state backtracking search method,which called EBGM.This method took use of the semantic network's directional,converting the graph matching problem into a path search planning and used the depth-first algorithm to form a search step set.And at the same time this paper created index for the all edges of the target graph to accelerate the process of forming edge mapping table,finally made connect of the edge mapping table to get the result set.Experiment results on the real dataset show that the algorithm has higher efficiency.

关键词

语义网络/图匹配/边映射表

Key words

semantic network/ graph matching/ edge mapping table

分类

信息技术与安全科学

引用本文复制引用

曹春萍,何佳..基于边映射表连接的匹配算法[J].计算机应用研究,2013,30(9):2697-2699,2703,4.

基金项目

国家自然科学基金资助项目(61074087) (61074087)

上海市教育委员会科研创新基金资助项目(12ZZ144) (12ZZ144)

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文