Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/3713
Title: | On Measuring of Similarity between Tree Nodes |
Authors: | Sologub, G. B. |
Issue Date: | 2011 |
Publisher: | St. Petersburg University Press |
Citation: | Sologub G. B. On Measuring of Similarity between Tree Nodes / G. B. Sologub // Web of Data: The joint RuSSIR/EDBT 2011 Summer School, August 15–19, 2011, Proceedings of the Fifth Russian Young Scientists Conference in Information Retrieval / B. Novikov, P. Braslavsky (Eds.). — St. Petersburg, 2011 — P. 63-71. |
Abstract: | In this paper, a survey of similarity measures between vertices of a graph is presented. Distance-based and structural equivalence measures are described. It is demonstrated that most of them degenerate if applied directly to the tree nodes. Adjusted path-based similarity measure is proposed as well as a new method for representing tree nodes as binary vectors that is based on using of an ancestor matrix. It is shown that application of ordinary similarity measures to this representation gives desired non-trivial results. |
Keywords: | SIMILARITY MEASURE DISTANCE ON TREE NODES STRUCTURAL EQUIVALENCE ANCESTOR MATRIX |
URI: | http://elar.urfu.ru/handle/10995/3713 |
Conference name: | V Russian Summer School in Information Retrieval (RuSSIR’2011) V Российская летняя школа по информационному поиску (RuSSIR’2011) EDBT Summer Schools |
Conference date: | 15.08.2011–19.08.2011 |
ISBN: | 978-5-288-05225-5 |
Origin: | RuSSIR/EDBT2011 |
Appears in Collections: | Информационный поиск |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RuSSIR_2011_07.pdf | 218,11 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.