基于路径映射的相似子图匹配算法

迄今为止，相关的图相似性匹配方法通常不考虑节点关系以及边权重的实际意义。提出一种基于路径映射 的相似子图匹配方法，用以更精确地查找具有相似拓扑结构的加权图。其创新之处在于充分利用标签信息，综合考虑 拓扑结构特征，克服了忽略节点结构关系和边权重的意义去分析图相似性的弊端。因此，该方法在很大程度上提高了 图相似性匹配的应用范围和匹配精度。实验表明本方法具有较高的查询质量和效率。

Subgraph Similarity Matching Based on Path Mapping

So far, the related similarity matching methods usually do not consider the relation between nodes and the practical significance of the weighted edges. This paper presented a similarity subgraph matching method based on path mapping. It can accurately locate the weighted graphs with similar topological structure. `hhe innovations of this paper are to make full use of the attribute information and to consider the topological structure characteristics, overcoming the ignorance of the structure relations and the significance of edge weights to analysis graph similarity. hherefore, the method can greatly improve the application scope of graph similarity matching and the experiment shows that this meth- od has higher searching quality and efficiency.