Pairwise normalization in Simrank variants: Problem, solution, and evaluation

Citations

WEB OF SCIENCE

4
Citations

SCOPUS

5

초록

Despite of the success in the real-world applications, SimRank and its variants, rvs-SimRank and PRank, suffer from the pairwise normalization problem (PNP) as a counter intuitive property hidden in their computation paradigm. JacSim, a state-of-the-art measure, provides an effective solution to PNP; however, it considers PNP and the effectiveness of the provided solution only in SimRank. In this paper, we consider PNP in SimRank variants, generalize the solution to those measures, conduct extensive experiments with two real-world datasets to accurately perform parameter tuning, and verify the effectiveness of applying the solution to SimRank variants with both un-weighted and weighted graphs.

키워드

Link-based similarity; Pairwise Normalization Problem JacSim; SimRank; Computation paradigms; Effective solution; Link-based; Pairwise Normalization Problem JacSim; Parameter-tuning; Real-world datasets; Simrank; State of the art; Computation theory
제목
Pairwise normalization in Simrank variants: Problem, solution, and evaluation
저자
Hamedani, Masoud Reyhani; Kim, Sang-Wook
DOI
10.1145/3297280.3297331
발행일
2019-04
유형
Conference Paper
저널명
Proceedings of the ACM Symposium on Applied Computing
권
Part F147772
페이지
534 ~ 541