Enhancing Cross-Lingual Entity Alignment in Knowledge Graphs through Structure Similarity Rearrangement
Cross-lingual entity alignment in knowledge graphs is a crucial task in knowledge fusion.
This task involves learning low-dimensional embeddings for nodes in different knowledge …
This task involves learning low-dimensional embeddings for nodes in different knowledge …
Personalized query techniques in graphs: A survey
Graph is a famous data structure that has prevalent applications in the real world, including
social networks, biological networks, and computer networks. In these applications, graph …
social networks, biological networks, and computer networks. In these applications, graph …
Efficient single-source SimRank query by path aggregation
M Zhang, Y **ao, W Wang - Proceedings of the 29th ACM SIGKDD …, 2023 - dl.acm.org
Single-source SimRank query calculates the similarity between a query node and every
node in a graph, which traverses the paths starting from the query node for similarity …
node in a graph, which traverses the paths starting from the query node for similarity …
Syncsignature: A simple, efficient, parallelizable framework for tree similarity joins
This paper introduces SyncSignature, the first fully parallelizable algorithmic framework for
tree similarity joins under edit distance. SyncSignature makes use of implicit-synchronized …
tree similarity joins under edit distance. SyncSignature makes use of implicit-synchronized …
CoSimHeat: An Effective Heat Kernel Similarity Measure Based on Billion-Scale Network Topology✱
Myriads of web applications in the Big Data era demand an effective measure of similarity
based on billion-scale network structures, eg, collaborative filtering. Recently, CoSimRank …
based on billion-scale network structures, eg, collaborative filtering. Recently, CoSimRank …
RoleSim*: Scaling axiomatic role-based similarity ranking on large graphs
RoleSim and SimRank are among the popular graph-theoretic similarity measures with
many applications in, eg, web search, collaborative filtering, and sociometry. While RoleSim …
many applications in, eg, web search, collaborative filtering, and sociometry. While RoleSim …
Scaling high-quality pairwise link-based similarity retrieval on billion-edge graphs
SimRank is an attractive link-based similarity measure used in fertile fields of Web search
and sociometry. However, the existing deterministic method by Kusumoto et al. for retrieving …
and sociometry. However, the existing deterministic method by Kusumoto et al. for retrieving …
CAGS: Context-Aware Document Ranking With Contrastive Graph Sampling
In search sessions, a series of interactions in the context has been proven to be
advantageous in capturing users' search intents. Existing studies show that designing pre …
advantageous in capturing users' search intents. Existing studies show that designing pre …
ExactSim: benchmarking single-source SimRank algorithms with high-precision ground truths
SimRank is a popular measurement for evaluating the node-to-node similarities based on
the graph topology. In recent years, single-source and top-k SimRank queries have received …
the graph topology. In recent years, single-source and top-k SimRank queries have received …
Efficient Algorithms for Group Hitting Probability Queries on Large Graphs
Given a source node and a target node, the hitting probability tells us how likely an-
terminating random walk (which stops with probability at each step) starting from can hit …
terminating random walk (which stops with probability at each step) starting from can hit …