Subgraph Similarity Matching Based on Path Mapping
Wang Hao-cheng · 2012
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.The 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.Therefore,the method can greatly improve the application scope of graph similarity matching and the experiment shows that this method has higher searching quality and efficiency.