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,
author = {Yu, W and McCann, J},
title = {Co-Simmate: Quick Retrieving All Pairwise Co-Simrank Relevance},
url = {http://hdl.handle.net/10044/1/23858},
year = {2015}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - Co-Simrank is a useful Simrank-like measureof similarity based on graph structure.The existing method iteratively computeseach pair of Co-Simrank score from a dotproduct of two Pagerank vectors, entailingO(log(1/)n3) time to compute all pairsof Co-Simranks in a graph with n nodes,to attain a desired accuracy . In this study,we devise a model, Co-Simmate, to speedup the retrieval of all pairs of Co-Simranksto O(log2(log(1/))n3) time. Moreover,we show the optimality of Co-Simmateamong other hop-(uk) variations, and integrateit with a matrix decomposition basedmethod on singular graphs to attain higherefficiency. The viable experiments verifythe superiority of Co-Simmate to others.
AU - Yu,W
AU - McCann,J
PY - 2015///
TI - Co-Simmate: Quick Retrieving All Pairwise Co-Simrank Relevance
UR - http://hdl.handle.net/10044/1/23858
ER -