Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions

Y Fang, K Wang, X Lin, W Zhang - Proceedings of the 2021 International …, 2021 - dl.acm.org
With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

Efficiently answering reachability and path queries on temporal bipartite graphs

X Chen, K Wang, X Lin, W Zhang, L Qin… - Proceedings of the …, 2021 - opus.lib.uts.edu.au
Bipartite graphs are naturally used to model relationships between two different types of
entities, such as people-location, authorpaper, and customer-product. When modeling real …

A survey on mining and analysis of uncertain graphs

S Banerjee - Knowledge and Information Systems, 2022 - Springer
An uncertain graph (also known as probabilistic graph) is a generic model to represent
many real-world networks from social to biological. In recent times, analysis and mining of …

Time-and Space-Efficiently Sketching Billion-Scale Attributed Networks

W Wu, S Li, M Jiang, C Luo, F Li - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Attributed network embedding seeks to depict each network node via a compact, low-
dimensional vector while effectively preserving the similarity between node pairs, which lays …

Jacsim*: An effective and efficient solution to the pairwise normalization problem in simrank

MR Hamedani, SW Kim - IEEE Access, 2021 - ieeexplore.ieee.org
Despite the fact that SimRank has been successfully applied to various applications as a link-
based similarity measure, it suffers from a counter-intuitive property called a pairwise …

[PDF][PDF] GSim+: Efficient Retrieval of Node-to-Node Similarity Across Two Graphs at Billion Scale.

R Zhang, W Yu - EDBT, 2024 - openproceedings.org
Numerous applications necessitate assessing the similarity between nodes across two
graphs using link structures. GSim, suggested by Blondel et al., is an appealing model …

[PDF][PDF] FaRS: A High-Performance Automorphism-Aware Algorithm for Graph Similarity Matching.

F Wang, W Yu, HH Wang, V Chang - COMPLEXIS, 2024 - researchgate.net
Role-based similarity search, predicated on the topological structure of graphs, is a highly
effective and widely applicable technique for various real-world information extraction …

[PDF][PDF] Unveiling critical node-to-node relationships for complex network analysis.

X Chen - 2021 - unsworks.unsw.edu.au
Graphs are widely used to represent interactions (ie, edges) between entities (ie,
nodes/vertices) in a large spectrum of applications, including social networks, biological …

Similarity Search over Network Structure

F Wang - 2021 - publications.aston.ac.uk
With the advent of the Internet, graph-structured data are ubiquitous. An essential task for
graph-structured data management is similarity search based on graph topology, with a …