Research of Approximate Subgraph Matching in Large Scale Network
Qin Zun-yue · Jisuanji gongcheng · 2012
Aiming at the accuracy for the impact of noise on the matching problem,this paper proposes an improved approximate subgraph matching method.In the preprocessing stage,it uses k-nearest neighbor graph for the vertices data set to establish a label-weight vector index.In the query process,it uses a single label weighting distance and the matching of the vertex's all neighbors for two levels matching filter to generate a candidate set of vertices;then spans tree matching and graph matching query graph in the process of determining the positioning of large networks.Experimental result on real data sets shows that the algorithm runs efficiently and it has higher accuracy.