Sig-SR: SimRank search over singular graphs

Yu, Weiren and McCann, Julie A. (2014). Sig-SR: SimRank search over singular graphs. IN: SIGIR '14 Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval. New York, NY (US): ACM.

Abstract

SimRank is an attractive structural-context measure of similarity between two objects in a graph. It recursively follows the intuition that "two objects are similar if they are referenced by similar objects". The best known matrix-based method [1] for calculating SimRank, however, implies an assumption that the graph is non-singular, its adjacency matrix is invertible. In reality, non-singular graphs are very rare; such an assumption in [1] is too restrictive in practice. In this paper, we provide a treatment of [1], by supporting similarity assessment on non-invertible adjacency matrices. Assume that a singular graph G has n nodes, with r(2+Kr2)) time for K iterations. In contrast, the only known matrix-based algorithm that supports singular graphs [1] needs O(r4n2) time. The experimental results on real and synthetic datasets demonstrate the superiority of InvSR on singular graphs against its baselines.

Divisions: Engineering & Applied Sciences
Event Title: 37th international ACM SIGIR conference on Research & Development in Information Retrieval
Event Type: Other
Event Dates: 2014-07-06 - 2014-07-11
Published Date: 2014-07-03
Authors: Yu, Weiren
McCann, Julie A.

Download

[img]

Version: Accepted Version


Export / Share Citation


Statistics

Additional statistics for this record