Search Results for author:
Found 12 papers, 9 papers with code
Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning
To overcome this problem, inspired by the recent success of graph contrastive learning and Siamese networks in visual representation learning, we propose a novel self-supervised approach in this paper to learn node representations by enhancing Siamese self-distillation with multi-scale contrastive learning.
Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming
To overcome the aforementioned problems, we introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming, namely G-Zoom, to learn node representations by leveraging the proposed adjusted zooming scheme.
CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning
As most of the existing graph neural networks yield effective graph representations of a single graph, little effort has been made for jointly learning two graph representations and calculating their similarity score.
Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination
Instead of similarity computation, GGD directly discriminates two groups of node samples with a very simple binary cross-entropy loss.
Unifying Graph Contrastive Learning with Flexible Contextual Scopes
To address aforementioned problems, we present a simple self-supervised learning method termed Unifying Graph Contrastive Learning with Flexible Contextual Scopes (UGCL for short).
Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating
Node representations are learned through contrasting the dual-channel encodings obtained from the discriminated homophilic and heterophilic edges.
Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation
We design a dual-intent network to learn user intent from an attention mechanism and the distribution of historical data respectively, which can simulate users' decision-making process in interacting with a new item.
A Survey on Fairness-aware Recommender Systems
As information filtering services, recommender systems have extremely enriched our daily life by providing personalized suggestions and facilitating people in decision-making, which makes them vital and indispensable to human society in the information era.
Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs
Real-world graphs generally have only one kind of tendency in their connections.
Integrating Graphs with Large Language Models: Methods and Prospects
Large language models (LLMs) such as GPT-4 have emerged as frontrunners, showcasing unparalleled prowess in diverse applications, including answering queries, code generation, and more.
Large Language Models for Scientific Synthesis, Inference and Explanation
We present a method for using general-purpose large language models to make inferences from scientific datasets of the form usually associated with special-purpose machine learning algorithms.
PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection
Comprising two modules - a pre-processing module and an ego-neighbor matching module - PREM eliminates the necessity for message-passing propagation during training, and employs a simple contrastive loss, leading to considerable reductions in training time and memory usage.
