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

Efficient partial-pairs simrank search on large networks

Tools
- Tools
+ Tools

Yu, Weiren and McCann, Julie A. (2015) Efficient partial-pairs simrank search on large networks. Proceedings of the VLDB Endowment, 8 (5). pp. 569-580. doi:10.14778/2735479.2735489 ISSN 2150-8097.

[img]
Preview
PDF
WRAP-efficient-partial-pairs-simrank-networks-Yu-2017.pdf - Accepted Version - Requires a PDF viewer.

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

Request Changes to record.

Abstract

The assessment of node-to-node similarities based on graph topology arises in a myriad of applications, e.g., web search. SimRank is a notable measure of this type, with the intuition that "two nodes are similar if their in-neighbors are similar". While most existing work retrieving SimRank only considers all-pairs SimRank s(*, *) and single-source SimRank s(*, j) (scores between every node and query j), there are appealing applications for partial-pairs SimRank, e.g., similarity join. Given two node subsets A and B in a graph, partial-pairs SimRank assessment aims to retrieve only {s(a, b)}∀aεA,∀bεB. However, the best-known solution appears not self-contained since it hinges on the premise that the SimRank scores with node-pairs in an h-go cover set must be given beforehand.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Z Bibliography. Library Science. Information Resources > ZA Information resources > ZA4050 Electronic information resources
Z Bibliography. Library Science. Information Resources > ZA Information resources > ZA4450 Databases
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Electronic information resources -- Data processing, Data mining -- Data processing, Database management , Web databases
Journal or Publication Title: Proceedings of the VLDB Endowment
Publisher: ACM
ISSN: 2150-8097
Official Date: January 2015
Dates:
DateEvent
January 2015Published
1 January 2015Accepted
Volume: 8
Number: 5
Page Range: pp. 569-580
DOI: 10.14778/2735479.2735489
Status: Peer Reviewed
Publication Status: Published
Reuse Statement (publisher, data, author rights): © Author | ACM 2015. 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/2735479.2735489
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 4 February 2020
Date of first compliant Open Access: 4 February 2020
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
Big Data Technology for Smart Water Network research projectNEC Corporationhttp://dx.doi.org/10.13039/501100013422

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