Similarity Measurement for Graph Data: An Improved Centrality and Geometric Perspective-Based Approach

How to make a precise similarity measurement for graph data is considered as highly recommended research in many fields. Hereinto, the so-named graph data is the coalition of patterns and edges that connect patterns. By taking both of pattern information and edge information into consideration, this paper introduces an improved centrality and geometric perspective-based approach to measure the similarity between any two graph data. Once these two graph data are projected into a plane, the pattern distance can be calculated by Euclid metric. With the help of the area composed by length of each edge and angle that constructed by the positive X-axis and the edge, the area-based edge distance is computed. To get better measurement, position-based edge distance is used to modify the edge distance. Up to now, the global distance between any two graph data can be determined by combining the above mentioned two distance results. Finally, the letter dataset is applied for experiment to examine the proposed similarity approach. The experimental results show that the proposed approach captures the similarity of graph data commendably and gets a tradeoff between time and precision.