Co-Simmate : quick retrieving all pairwise co-Simrank scores

Abstract

Co-Simrank is a useful Simrank-like measure of similarity based on graph structure. The existing method iteratively computes each pair of Co-Simrank score from a dot product of two Pagerank vectors, entailing O(log(1/e)*n^3) time to compute all pairs of Co-Simranks in a graph with n nodes, to attain a desired accuracy e. In this study, we devise a model, Co-Simmate, to speed up the retrieval of all pairs of Co-Simranks to O(log2 (log(1/e))*n^3) time. Moreover, we show the optimality of Co-Simmate among other hop-(u^k) variations, and integrate it with a matrix decomposition based method on singular graphs to attain higher efficiency. The viable experiments verify the superiority of Co-Simmate to others.

Publication DOI: https://doi.org/10.3115/v1/P15-2054
Divisions: Engineering & Applied Sciences
Engineering & Applied Sciences > Systems analytics research institute (SARI)
Additional Information: ACL materials are Copyright © 1963–2019 ACL; other materials are copyrighted by their respective copyright holders. Materials prior to 2016 here are licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 International License.
Event Title: 53rd Annual Meeting of the Association for Computational Linguistics / 7th International Joint Conference on Natural Language Processing
Event Type: Other
Event Dates: 2015-07-26 - 2015-07-31
PURE Output Type: Conference contribution
Published Date: 2015
Accepted Date: 2015-06-10
Authors: Yu, Weiren
McCann, Julie A.

Export / Share Citation


Statistics

Additional statistics for this record