{"total":61,"rows":[{"id":"2112.14936","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","created":"2021-12-30","cited_by_count":176,"area":null},{"id":"2207.10128","title":"Towards Better Evaluation for Dynamic Link Prediction","created":"2022-07-20","cited_by_count":122,"area":null},{"id":"2109.01116","title":"An Empirical Study of Graph Contrastive Learning","created":"2021-09-02","cited_by_count":113,"area":null},{"id":"2306.10453","title":"Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking","created":"2023-06-18","cited_by_count":69,"area":null},{"id":"2201.08236","title":"Temporal Knowledge Graph Completion: A Survey","created":"2022-01-16","cited_by_count":61,"area":null},{"id":"2107.01886","title":"Self-Contrastive Learning with Hard Negative Sampling for Self-supervised Point Cloud Learning","created":"2021-07-05","cited_by_count":52,"area":null},{"id":"2201.02534","title":"MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs","created":"2022-01-07","cited_by_count":28,"area":null},{"id":"2201.05493","title":"Contrastive Laplacian Eigenmaps","created":"2022-01-14","cited_by_count":24,"area":null},{"id":"2110.08264","title":"Self-supervised Contrastive Attributed Graph Clustering","created":"2021-10-15","cited_by_count":18,"area":null},{"id":"2206.11549","title":"Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Sampling","created":"2022-06-23","cited_by_count":14,"area":null},{"id":"2308.02457","title":"A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects","created":"2023-08-04","cited_by_count":14,"area":null},{"id":"2102.07186","title":"Relation-aware Graph Attention Model With Adaptive Self-adversarial Training","created":"2021-02-14","cited_by_count":12,"area":null},{"id":"2211.14394","title":"Link Prediction with Non-Contrastive Learning","created":"2022-11-25","cited_by_count":11,"area":null},{"id":"2210.00728","title":"Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples","created":"2022-10-03","cited_by_count":10,"area":null},{"id":"2209.15292","title":"The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm","created":"2022-09-30","cited_by_count":9,"area":null},{"id":"2311.01196","title":"Combating Bilateral Edge Noise for Robust Link Prediction","created":"2023-11-02","cited_by_count":9,"area":null},{"id":"2402.19195","title":"Negative Sampling in Knowledge Graph Representation Learning: A Review","created":"2024-02-29","cited_by_count":9,"area":null},{"id":"2403.17259","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","created":"2024-03-25","cited_by_count":9,"area":null},{"id":"2304.07503","title":"Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation","created":"2023-04-15","cited_by_count":8,"area":null},{"id":"2407.20684","title":"RevGNN: Negative Sampling Enhanced Contrastive Graph Learning for Academic Reviewer Recommendation","created":"2024-07-30","cited_by_count":8,"area":null},{"id":"2104.00501","title":"NuPS: A Parameter Server for Machine Learning with Non-Uniform Parameter Access","created":"2021-04-01","cited_by_count":7,"area":null},{"id":"2106.07250","title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","created":"2021-06-14","cited_by_count":7,"area":null},{"id":"2203.10866","title":"Unsupervised Network Embedding Beyond Homophily","created":"2022-03-21","cited_by_count":7,"area":null},{"id":"2212.02055","title":"Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processes","created":"2022-12-05","cited_by_count":7,"area":null},{"id":"2306.03355","title":"BatchSampler: Sampling Mini-Batches for Contrastive Learning in Vision, Language, and Graphs","created":"2023-06-06","cited_by_count":7,"area":null},{"id":"2403.11408","title":"Layer-diverse Negative Sampling for Graph Neural Networks","created":"2024-03-18","cited_by_count":7,"area":null},{"id":"2101.11525","title":"Calibrating and Improving Graph Contrastive Learning","created":"2021-01-27","cited_by_count":6,"area":null},{"id":"2306.06936","title":"CARL-G: Clustering-Accelerated Representation Learning on Graphs","created":"2023-06-12","cited_by_count":6,"area":null},{"id":"2306.10047","title":"Neighborhood-based Hard Negative Mining for Sequential Recommendation","created":"2023-06-12","cited_by_count":5,"area":null},{"id":"2312.12882","title":"BSL: Understanding and Improving Softmax Loss for Recommendation","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2406.16170","title":"SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering","created":"2024-06-23","cited_by_count":4,"area":null},{"id":"2407.12703","title":"Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive Learning","created":"2024-07-17","cited_by_count":4,"area":null},{"id":"2111.10772","title":"Network representation learning: A macro and micro view","created":"2021-11-21","cited_by_count":3,"area":null},{"id":"2208.03645","title":"Generating Negative Samples for Sequential Recommendation","created":"2022-08-07","cited_by_count":3,"area":null},{"id":"2409.04572","title":"Neurosymbolic Methods for Dynamic Knowledge Graphs","created":"2024-09-06","cited_by_count":3,"area":null},{"id":"2306.09519","title":"Relation-Aware Network with Attention-Based Loss for Few-Shot Knowledge Graph Completion","created":"2023-06-15","cited_by_count":2,"area":null},{"id":"2306.15905","title":"Dimension Independent Mixup for Hard Negative Sample in Collaborative Filtering","created":"2023-06-28","cited_by_count":2,"area":null},{"id":"2404.10575","title":"EMC$^2$: Efficient MCMC Negative Sampling for Contrastive Learning with Global Convergence","created":"2024-04-16","cited_by_count":2,"area":null},{"id":"2506.01728","title":"Principled Data Augmentation for Learning to Solve Quadratic Programming Problems","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2507.07744","title":"Sparse-Dense Side-Tuner for efficient Video Temporal Grounding","created":"2025-07-10","cited_by_count":2,"area":null},{"id":"2102.03302","title":"Self-Supervised Deep Graph Embedding with High-Order Information Fusion for Community Discovery","created":"2021-02-05","cited_by_count":1,"area":null},{"id":"2102.07575","title":"User Embedding based Neighborhood Aggregation Method for Inductive Recommendation","created":"2021-02-15","cited_by_count":1,"area":null},{"id":"2204.06520","title":"Bayesian Negative Sampling for Recommendation","created":"2022-04-02","cited_by_count":1,"area":null},{"id":"2309.13227","title":"Importance of negative sampling in weak label learning","created":"2023-09-23","cited_by_count":1,"area":null},{"id":"2402.09239","title":"Robust Training of Temporal GNNs using Nearest Neighbours based Hard Negatives","created":"2024-02-14","cited_by_count":1,"area":null},{"id":"2409.08543","title":"ATFLRec: A Multimodal Recommender System with Audio-Text Fusion and Low-Rank Adaptation via Instruction-Tuned Large Language Model","created":"2024-09-13","cited_by_count":1,"area":null},{"id":"2504.03327","title":"Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction","created":"2025-04-04","cited_by_count":1,"area":null},{"id":"2204.10558","title":"Sparse and Dense Approaches for the Full-rank Retrieval of Responses for Dialogues","created":"2022-04-22","cited_by_count":0,"area":null},{"id":"2205.14403","title":"Rethinking the Setting of Semi-supervised Learning on Graphs","created":"2022-05-28","cited_by_count":0,"area":null},{"id":"2206.13223","title":"MultiSAGE: a multiplex embedding algorithm for inter-layer link prediction","created":"2022-06-24","cited_by_count":0,"area":null},{"id":"2311.02921","title":"Edge2Node: Reducing Edge Prediction to Node Classification","created":"2023-11-06","cited_by_count":0,"area":null},{"id":"2311.16605","title":"LasTGL: An Industrial Framework for Large-Scale Temporal Graph Learning","created":"2023-11-28","cited_by_count":0,"area":null},{"id":"2402.10468","title":"Adversarial Curriculum Graph Contrastive Learning with Pair-wise Augmentation","created":"2024-02-16","cited_by_count":0,"area":null},{"id":"2405.00172","title":"Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings","created":"2024-04-30","cited_by_count":0,"area":null},{"id":"2406.07098","title":"Guiding Catalogue Enrichment with User Queries","created":"2024-06-11","cited_by_count":0,"area":null},{"id":"2408.06665","title":"RW-NSGCN: A Robust Approach to Structural Attacks via Negative Sampling","created":"2024-08-13","cited_by_count":0,"area":null},{"id":"2410.07592","title":"Diversified and Adaptive Negative Sampling on Knowledge Graphs","created":"2024-10-10","cited_by_count":0,"area":null},{"id":"2501.12884","title":"Learning Graph Node Embeddings by Smooth Pair Sampling","created":"2025-01-22","cited_by_count":0,"area":null},{"id":"2502.08161","title":"MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendation","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2506.20818","title":"Demystifying Distributed Training of Graph Neural Networks for Link Prediction","created":"2025-06-25","cited_by_count":0,"area":null},{"id":"2605.09408","title":"GravityGraphSAGE: Link Prediction in Directed Attributed Graphs","created":"2026-05-10","cited_by_count":0,"area":null}],"next_cursor":null}