Efficient Privacy-Preserving Federated Graph Analytics for Certain Queries
Colo, a new system, enables efficient privacy-preserving federated graph analytics for a subset of queries by using tailored secure computation and metadata-hiding communication protocols.
Parallel Louvain Algorithm with Efficient Handling of Internally-Disconnected Communities
A parallel implementation of the Louvain algorithm, called GSP-Louvain, that effectively addresses the issue of internally-disconnected communities while achieving significantly faster processing speeds compared to existing alternatives.
Efficient Neural Attributed Community Search at Billion-Scale
An efficient and effective neural network model, ALICE, for attributed community search in large-scale graphs. ALICE first extracts a promising candidate subgraph and then predicts the community using a consistency-aware neural network.
Unsupervised Community Search with Pre-trained Graph Transformer
The core message of this article is to propose a pre-trained graph Transformer based community search framework, termed TransZero, that can efficiently and effectively identify communities without using any ground-truth labels.
Optimizing Graph Partitioning with S5P Algorithm
The author proposes the S5P algorithm to address the challenges of streaming graph partitioning by leveraging skewness characteristics, achieving high-quality partitioning through a Stackelberg game approach.
© 2024 by Linnk AI