Look before You Leap: Confirming Edge Signs in Random Walk with Restart for Personalized Node Ranking in Signed Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, W. | - |
dc.contributor.author | Lee, Y.-C. | - |
dc.contributor.author | Lee, D. | - |
dc.contributor.author | Kim, S.-W. | - |
dc.date.accessioned | 2022-07-06T16:23:22Z | - |
dc.date.available | 2022-07-06T16:23:22Z | - |
dc.date.created | 2021-11-22 | - |
dc.date.issued | 2021-07 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/141482 | - |
dc.description.abstract | In this paper, we address the personalized node ranking (PNR) problem for signed networks, which aims to rank nodes in an order most relevant to a given seed node in a signed network. The recently-proposed PNR methods introduce the concept of the signed random surfer, denoted as SRSurfer, that performs the score propagation between nodes using the balance theory. However, in real settings of signed networks, edge relationships often do not strictly follow the rules of the balance theory. Therefore, SRSurfer-based PNR methods frequently perform incorrect score propagation to nodes, thereby degrading the accuracy of PNR. To address this limitation, we propose a novel random-walk based PNR approach with sign verification, named as OBOE (lOok Before yOu lEap). Specifically, OBOE carefully verifies the score propagation of SRSurfer by using the topological features of nodes. Then, OBOE corrects all incorrect score propagation cases by exploiting the statistics of a given network. The experiments on 3 real-world signed networks show that OBOE consistently and significantly outperforms 5 competing methods with improvement up to 13%, 95%, and 249% in top-k PNR, bottom-k PNR, and troll identification tasks, respectively. All OBOE codes and datasets are available at: http://github.com/wonchang24/OBOE. © 2021 ACM. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery, Inc | - |
dc.title | Look before You Leap: Confirming Edge Signs in Random Walk with Restart for Personalized Node Ranking in Signed Networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, S.-W. | - |
dc.identifier.doi | 10.1145/3404835.3462923 | - |
dc.identifier.scopusid | 2-s2.0-85111633130 | - |
dc.identifier.wosid | 000719807900015 | - |
dc.identifier.bibliographicCitation | SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.143 - 152 | - |
dc.relation.isPartOf | SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval | - |
dc.citation.title | SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval | - |
dc.citation.startPage | 143 | - |
dc.citation.endPage | 152 | - |
dc.type.rims | ART | - |
dc.type.docType | Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | Information retrieval | - |
dc.subject.keywordPlus | Random Walk | - |
dc.subject.keywordPlus | Random walk with restart | - |
dc.subject.keywordPlus | Real-world | - |
dc.subject.keywordPlus | Score propagation | - |
dc.subject.keywordPlus | Signed networks | - |
dc.subject.keywordPlus | Topological features | - |
dc.subject.keywordPlus | Random processes | - |
dc.subject.keywordAuthor | balance theory | - |
dc.subject.keywordAuthor | personalized node ranking | - |
dc.subject.keywordAuthor | signed networks | - |
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.