JacSim∗: An Effective and Efficient Solution to the Pairwise Normalization Problem in SimRankopen access
- Authors
- Hamedani, Masoud Reyhani; Kim, Sang-Wook
- Issue Date
- Oct-2021
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Sparse matrices; Time complexity; Social networking (online); Philosophical considerations; Licenses; Directed graphs; Web pages; Link-based similarity; pairwise normalization problem; similarity computation; SimRank
- Citation
- IEEE ACCESS, v.9, pp.146038 - 146049
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE ACCESS
- Volume
- 9
- Start Page
- 146038
- End Page
- 146049
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/140680
- DOI
- 10.1109/ACCESS.2021.3123114
- ISSN
- 2169-3536
- Abstract
- Despite the fact that SimRank has been successfully applied to various applications as a link-based similarity measure, it suffers from a counter-intuitive property called a pairwise normalization problem; JacSim is a powerful variant of SimRank that alleviates this problem. In this paper, we first point out three existing drawbacks of JacSim and then propose JacSim∗ to effectively solve them; JacSim∗ exploits those paths neglected by JacSim in similarity computation, its matrix form provides the exact similarity scores while not being sensitive to the number of node-pairs with common neighbors, and it has simpler, easier to understand, and easier to implement formulas in both iterative and matrix forms than those of JacSim. We conduct extensive experiments with eight real-world datasets to evaluate both the accuracy and performance of JacSim∗ in comparison with those of JacSim. Our experimental results demonstrate that JacSim∗ shows better accuracy than JacSim and the JacSim∗ matrix form is dramatically faster than its own iterative form and also than the two forms of JacSim with all datasets.
- Files in This Item
-
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.