Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/473
Title: | Measuring similarity of graph nodes by neighbor matching | Authors: | Nikolić, Mladen | Affiliations: | Informatics and Computer Science | Keywords: | Graph node similarity;graph similarity;similarity measure | Issue Date: | 1-Dec-2012 | Journal: | Intelligent Data Analysis | Abstract: | The problem of measuring similarity of graph nodes is important in a range of practical problems. There is a number of proposed measures, usually based on iterative calculation of similarity 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 nodes that involves matching 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. In addition, we construct a measure of similarity of whole graphs based on the similarities of nodes. We illustrate the proposed method on several specific problems and empirically compare it to other methods. © 2012 - IOS Press and the authors. All rights reserved. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/473 | ISSN: | 1088467X | DOI: | 10.3233/IDA-2012-00556 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
30
checked on Dec 21, 2024
Page view(s)
22
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.