Efficient Similarity Search for Sets over Graphs

YEAR : 2021

Categories: , , Tags: , ,


Measuring similarities among different nodes is important in graph analysis tasks, such as link prediction, and recommendation. Among different similarity measures, SimRank is one of the most popular and promising ones, and has received a lot of research attention. While most current studies focus on single-pair, single-source/top-k, and all-pairs SimRank computation, few of them have studied finding similar pairs given a set of node pairs, which has attractive applications in personalized search and recommendation tasks. In this project, we present Carmo, an efficient algorithm for retrieving the top-k similarities from an arbitrary set of pairs. In addition, we introduce two types of indexes to boost the efficiency of Carmo: one is hub-based, the other is tree-based. We show the effectiveness and efficiency of our proposed methods by extensive experiments.



System : Intel i3 and above
Hard Disk : 40GB
RAM : Minimum 4GB
Processer : 64-bit, four-core, 2.5 GHz minimum per core


Front End Language : HTML, CSS, JAVA, JSP SERVELTS
Backend : My SQL
Operating System : Windows 10 or 11


There are no reviews yet.

Be the first to review “Efficient Similarity Search for Sets over Graphs”

Your email address will not be published. Required fields are marked *

Product Enquiry