Role Similarity Metric Based on Spanning Rooted Forest

10/15/2021
by   Qi Bao, et al.
0

As a fundamental issue in network analysis, structural node similarity has received much attention in academia and is adopted in a wide range of applications. Among these proposed structural node similarity measures, role similarity stands out because of satisfying several axiomatic properties including automorphism conformation. Existing role similarity metrics cannot handle top-k queries on large real-world networks due to the high time and space cost. In this paper, we propose a new role similarity metric, namely . We prove that is an admissible role similarity metric and devise the corresponding top-k similarity search algorithm, namely , which is able to process a top-k query in O(k) time once the precomputation is finished. Moreover, we speed up the precomputation by using a fast approximate algorithm to compute the diagonal entries of the forest matrix, which reduces the time and space complexity of the precomputation to O(ϵ^-2mlog^5nlog1/ϵ) and O(mlog^3n), respectively. Finally, we conduct extensive experiments on 26 real-world networks. The results show that works efficiently on million-scale networks and achieves comparable performance to the state-of-art methods.

READ FULL TEXT
research
05/25/2018

struc2gauss: Structure Preserving Network Embedding via Gaussian Embedding

Network embedding (NE) is playing a principal role in network mining, du...
research
08/04/2022

Unconventional application of k-means for distributed approximate similarity search

Similarity search based on a distance function in metric spaces is a fun...
research
07/18/2021

A Survey on Role-Oriented Network Embedding

Recently, Network Embedding (NE) has become one of the most attractive r...
research
01/19/2018

CGQ: Relationship-Aware Contextual Graph Querying in Large Networks

The phenomenal growth of graph data from a wide-variety of real-world ap...
research
09/24/2020

Dynamic Similarity Search on Integer Sketches

Similarity-preserving hashing is a core technique for fast similarity se...
research
05/03/2018

Dynamic Structural Similarity on Graphs

One way of characterizing the topological and structural properties of v...
research
10/02/2022

Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies

Graph embedding provides a feasible methodology to conduct pattern class...

Please sign up or login with your details

Forgot password? Click here to reset