Measuring Similarity of Graphs and their Nodes by Neighbor Matching

Details Measuring Similarity of Graphs and their Nodes by Neighbor Matching Measuring Similarity of Graphs and their Nodes by Neighbor Matching

2010-09-27

arxiv.org/abs/1009.5290v1

Computer Science

Artificial Intelligence

Scientific paper

The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the principle that two nodes are as similar as their neighbors are. In our work, we propose one novel method of that sort, with a refined concept of similarity of two nodes that involves matching of their neighbors. We prove convergence of the proposed method and show that it has some additional desirable properties that, to our knowledge, the existing methods lack. We illustrate the method on two specific problems and empirically compare it to other methods.

Affiliated with

Also associated with

No associations

Rating

Measuring Similarity of Graphs and their Nodes by Neighbor Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Measuring Similarity of Graphs and their Nodes by Neighbor Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Measuring Similarity of Graphs and their Nodes by Neighbor Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518349