Imperial College London

ProfessorJulieMcCann

Faculty of EngineeringDepartment of Computing

Professor of Computer Systems
 
 
 
//

Contact

 

+44 (0)20 7594 8375j.mccann Website

 
 
//

Location

 

258ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Yu:2015:10.1145/2806416.2806610,
author = {Yu, W and McCann, JA},
doi = {10.1145/2806416.2806610},
pages = {1791--1794},
publisher = {Association for Computing Machinery},
title = {Gauging Correct Relative Rankings For Similarity Search},
url = {http://dx.doi.org/10.1145/2806416.2806610},
year = {2015}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - One of the important tasks in link analysis is to quantify the similarity between two objects based on hyperlink structure. SimRank is an attractive similarity measure of this type. Existing work mainly focuses on absolute SimRank scores, and often harnesses an iterative paradigm to compute them. While these iterative scores converge to exact ones with the increasing number of iterations, it is still notoriously difficult to determine how well the relative orders of these iterative scores can be preserved for a given iteration. In this paper, we propose efficient ranking criteria that can secure correct relative orders of node-pairs with respect to SimRank scores when they are computed in an iterative fashion. Moreover, we show the superiority of our criteria in harvesting top-K SimRank scores and bucket orders from a full ranking list. Finally, viable empirical studies verify the usefulness of our techniques for SimRank top-K ranking and bucket ordering.
AU - Yu,W
AU - McCann,JA
DO - 10.1145/2806416.2806610
EP - 1794
PB - Association for Computing Machinery
PY - 2015///
SP - 1791
TI - Gauging Correct Relative Rankings For Similarity Search
UR - http://dx.doi.org/10.1145/2806416.2806610
UR - http://hdl.handle.net/10044/1/36992
ER -