Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

More is simpler : effectively and efficiently assessing node-pair similarities based on hyperlinks

Tools
- Tools
+ Tools

Yu, Weiren, Lin, Xuemin, Zhang, Wenjie, Chang, Lijun and Pei, Jian (2013) More is simpler : effectively and efficiently assessing node-pair similarities based on hyperlinks. Proceedings of the VLDB Endowment, 7 (1). pp. 13-24. doi:10.14778/2732219.2732221 ISSN 2150-8097.

[img]
Preview
PDF
WRAP-More-simpler-effectively-efficiently-assessing-Yu-2013.pdf - Accepted Version - Requires a PDF viewer.

Download (953Kb) | Preview
Official URL: http://dx.doi.org/10.14778/2732219.2732221

Request Changes to record.

Abstract

Similarity assessment is one of the core tasks in hyperlink analysis. Recently, with the proliferation of applications, e.g., web search and collaborative filtering, SimRank has been a well-studied measure of similarity between two nodes in a graph. It recursively follows the philosophy that "two nodes are similar if they are referenced (have incoming edges) from similar nodes", which can be viewed as an aggregation of similarities based on incoming paths. Despite its popularity, SimRank has an undesirable property, i.e., "zero-similarity": It only accommodates paths with equal length from a common "center" node. Thus, a large portion of other paths are fully ignored. This paper attempts to remedy this issue. (1) We propose and rigorously justify SimRank*, a revised version of SimRank, which resolves such counter-intuitive "zero-similarity" issues while inheriting merits of the basic SimRank philosophy. (2) We show that the series form of SimRank* can be reduced to a fairly succinct and elegant closed form, which looks even simpler than SimRank, yet enriches semantics without suffering from increased computational cost. This leads to a fixed-point iterative paradigm of SimRank* in O(Knm) time on a graph of n nodes and m edges for K iterations, which is comparable to SimRank. (3) To further optimize SimRank* computation, we leverage a novel clustering strategy via edge concentration. Due to its NP-hardness, we devise an efficient and effective heuristic to speed up SimRank* computation to O(Knm) time, where m is generally much smaller than m. (4) Using real and synthetic data, we empirically verify the rich semantics of SimRank*, and demonstrate its high computation efficiency.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Graph theory -- Data processing, Data mining, Information networks --Mathematics, Graph algorithms, SimRank, Discrete mathematics
Journal or Publication Title: Proceedings of the VLDB Endowment
Publisher: ACM
ISSN: 2150-8097
Official Date: September 2013
Dates:
DateEvent
September 2013Published
Volume: 7
Number: 1
Page Range: pp. 13-24
DOI: 10.14778/2732219.2732221
Status: Peer Reviewed
Publication Status: Published
Reuse Statement (publisher, data, author rights): © Author | ACM 2013. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the VLDB Endowment, http://dx.doi.org/10.14778/2732219.2732221
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 31 January 2020
Date of first compliant Open Access: 17 February 2020

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us