Reachability vectors: Features for link-based similarity measures
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yoon, Seok-Ho | - |
dc.contributor.author | Kim, Ji-Soo | - |
dc.contributor.author | Ha, Ji-Soo | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Ryu, Minsoo | - |
dc.contributor.author | Choi, Ho-Jin | - |
dc.date.accessioned | 2022-07-16T05:38:27Z | - |
dc.date.available | 2022-07-16T05:38:27Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2014-03 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/160469 | - |
dc.description.abstract | In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not suffer from these problems. In the proposed approach, each target object is represented by a vector. The elements of the vector denote all the objects in the given data set, and the value of each element indicates the weight of the corresponding object with respect to the target object. As for this weight value, we propose to utilize the probability of reaching from the target object to the specific object, computed using the Random Walk with Restart strategy. Then, we define the similarity between two objects as the cosine similarity of the two vectors representing the two objects. We also evaluate the performance of the proposed approach in comparison with existing link-based measures using two kinds of data sets. Our experimental results show that the proposed approach significantly outperform the existing measures. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | Reachability vectors: Features for link-based similarity measures | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.contributor.affiliatedAuthor | Ryu, Minsoo | - |
dc.identifier.doi | 10.1145/2554850.2554906 | - |
dc.identifier.scopusid | 2-s2.0-84905642557 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Symposium on Applied Computing, pp.594 - 597 | - |
dc.relation.isPartOf | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.title | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.startPage | 594 | - |
dc.citation.endPage | 597 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Computation theory | - |
dc.subject.keywordPlus | Cosine similarity | - |
dc.subject.keywordPlus | Link-based | - |
dc.subject.keywordPlus | Link-based measures | - |
dc.subject.keywordPlus | Random walk with restart | - |
dc.subject.keywordPlus | Reachability | - |
dc.subject.keywordPlus | Similarity measure | - |
dc.subject.keywordPlus | Target object | - |
dc.subject.keywordPlus | Weight values | - |
dc.subject.keywordPlus | Vectors | - |
dc.subject.keywordAuthor | Link-based similarity measure | - |
dc.subject.keywordAuthor | Reachability vector | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2554850.2554906 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.