Are Graph Representation Learning Methods Robust to Graph Sparsity and Asymmetric Node Information?
The growing popularity of Graph Representation Learning (GRL) methods has resulted in the development of a large number of models applied to a miscellany of domains. Behind this diversity of domains, there is a strong heterogeneity of graphs, making it difficult to estimate the expected performance of a model on a new graph, especially when the graph has distinctive characteristics that have not been encountered in the benchmark yet. To address this, we have developed an experimental pipeline, to assess the impact of a given property on the models performances. In this paper, we use this pipeline to study the effect of two specificities encountered on banks transactional graphs resulting from the partial view a bank has on all the individuals and transactions carried out on the market. These specific features are graph sparsity and asymmetric node information. This study demonstrates the robustness of GRL methods to these distinctive characteristics. We believe that this work can ease the evaluation of GRL methods to specific characteristics and foster the development of such methods on transactional graphs.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityGraph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
RaDAR: Relation-aware Diffusion-Asymmetric Graph Contrastive Learning for Recommendation
Collaborative filtering (CF) recommendation has been significantly advanced by integrating Graph Neural Networks (GNNs) and Graph Contrastive Learning (GCL). However, (i) random edge perturbations often distort critical …
Collaborative FilteringRecommendation SystemsContrastive LearningSimple and Asymmetric Graph Contrastive Learning without Augmentations
Graph Contrastive Learning (GCL) has shown superior performance in representation learning in graph-structured data. Despite their success, most existing GCL methods rely on prefabricated graph augmentation and homophily…
Contrastive LearningRepresentation LearningSelf-Supervised LearningAsymmetric Learning for Graph Neural Network based Link Prediction
Link prediction is a fundamental problem in many graph based applications, such as protein-protein interaction prediction. Graph neural network (GNN) has recently been widely used for link prediction. However, existing G…
Graph Neural NetworkLink PredictionPredictionRepresentation LearningGraph Masked Autoencoders with Transformers
Recently, transformers have shown promising performance in learning graph representations. However, there are still some challenges when applying transformers to real-world scenarios due to the fact that deep transformer…
DecoderGraph ClassificationNode ClassificationS2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs
Pre-training on text-attributed graphs (TAGs) is central to building transferable graph foundation models, where LLM-as-Aligner methods align graph and text representations through the semantic knowledge of large languag…
Domain Generalization