{"total":54,"rows":[{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2101.08543","title":"Boost then Convolve: Gradient Boosting Meets Graph Neural Networks","created":"2021-01-21","cited_by_count":44,"area":null},{"id":"2210.05801","title":"Linkless Link Prediction via Relational Distillation","created":"2022-10-11","cited_by_count":39,"area":null},{"id":"2409.06091","title":"Scalable Multitask Learning Using Gradient-based Estimation of Task Affinity","created":"2024-09-09","cited_by_count":20,"area":null},{"id":"2110.07582","title":"Network Representation Learning: From Preprocessing, Feature Extraction to Node Embedding","created":"2021-10-14","cited_by_count":19,"area":null},{"id":"2206.12327","title":"Source Localization of Graph Diffusion via Variational Autoencoders for Graph Inverse Problems","created":"2022-06-24","cited_by_count":18,"area":null},{"id":"2110.12344","title":"A Broader Picture of Random-walk Based Graph Embedding","created":"2021-10-24","cited_by_count":16,"area":null},{"id":"2306.14009","title":"Boosting Multitask Learning on Graphs through Higher-Order Task Affinities","created":"2023-06-24","cited_by_count":15,"area":null},{"id":"2207.06944","title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank","created":"2022-07-14","cited_by_count":12,"area":null},{"id":"2106.15347","title":"DeepGD: A Deep Learning Framework for Graph Drawing Using GNN","created":"2021-06-27","cited_by_count":10,"area":null},{"id":"2305.16562","title":"Unsupervised Embedding Quality Evaluation","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2102.02302","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","created":"2021-02-03","cited_by_count":8,"area":null},{"id":"2105.10651","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","created":"2021-05-22","cited_by_count":8,"area":null},{"id":"2405.11922","title":"Effective Clustering on Large Attributed Bipartite Graphs","created":"2024-05-20","cited_by_count":7,"area":null},{"id":"2110.15087","title":"MOOMIN: Deep Molecular Omics Network for Anti-Cancer Drug Combination Therapy","created":"2021-10-28","cited_by_count":6,"area":null},{"id":"2211.11583","title":"Recommending Related Products Using Graph Neural Networks in Directed Graphs","created":"2022-11-18","cited_by_count":6,"area":null},{"id":"2309.13599","title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","created":"2023-09-24","cited_by_count":6,"area":null},{"id":"2312.04762","title":"The Graph Lottery Ticket Hypothesis: Finding Sparse, Informative Graph Structure","created":"2023-12-08","cited_by_count":6,"area":null},{"id":"2406.05482","title":"Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks","created":"2024-06-08","cited_by_count":6,"area":null},{"id":"2106.05476","title":"Learning Based Proximity Matrix Factorization for Node Embedding","created":"2021-06-10","cited_by_count":5,"area":null},{"id":"2102.08275","title":"Evaluating Node Embeddings of Complex Networks","created":"2021-02-16","cited_by_count":4,"area":null},{"id":"2106.05057","title":"Multiple Kernel Representation Learning on Networks","created":"2021-06-09","cited_by_count":3,"area":null},{"id":"2308.10077","title":"Contrastive Learning for Non-Local Graphs with Multi-Resolution Structural Views","created":"2023-08-19","cited_by_count":3,"area":null},{"id":"2312.03691","title":"On the Role of Edge Dependency in Graph Generative Models","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2105.09182","title":"Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling","created":"2021-05-19","cited_by_count":2,"area":null},{"id":"2106.12621","title":"Leveraging semantically similar queries for ranking via combining representations","created":"2021-06-23","cited_by_count":2,"area":null},{"id":"2112.10372","title":"A Comprehensive Analytical Survey on Unsupervised and Semi-Supervised Graph Representation Learning Methods","created":"2021-12-20","cited_by_count":2,"area":null},{"id":"2211.15114","title":"LoNe Sampler: Graph node embeddings by coordinated local neighborhood sampling","created":"2022-11-28","cited_by_count":2,"area":null},{"id":"2303.15702","title":"Distributed Graph Embedding with Information-Oriented Random Walks","created":"2023-03-28","cited_by_count":2,"area":null},{"id":"2305.03474","title":"Zoo Guide to Network Embedding","created":"2023-05-05","cited_by_count":2,"area":null},{"id":"2104.13323","title":"Network Embedding via Deep Prediction Model","created":"2021-04-27","cited_by_count":1,"area":null},{"id":"2109.07583","title":"Network representation learning systematic review: ancestors and current development state","created":"2021-09-14","cited_by_count":1,"area":null},{"id":"2110.11335","title":"Convex Joint Graph Matching and Clustering via Semidefinite Relaxations","created":"2021-10-21","cited_by_count":1,"area":null},{"id":"2210.03282","title":"Set2Box: Similarity Preserving Representation Learning of Sets","created":"2022-10-07","cited_by_count":1,"area":null},{"id":"2306.08967","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","created":"2023-06-15","cited_by_count":1,"area":null},{"id":"2307.14490","title":"HUGE: Huge Unsupervised Graph Embeddings with TPUs","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2408.02705","title":"PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding","created":"2024-08-05","cited_by_count":1,"area":null},{"id":"2102.04770","title":"COLOGNE: Coordinated Local Graph Neighborhood Sampling","created":"2021-02-09","cited_by_count":0,"area":null},{"id":"2106.03723","title":"Self-Supervised Graph Learning with Proximity-based Views and Channel Contrast","created":"2021-06-07","cited_by_count":0,"area":null},{"id":"2109.04206","title":"QUINT: Node embedding using network hashing","created":"2021-09-09","cited_by_count":0,"area":null},{"id":"2110.10049","title":"Boosting Graph Embedding on a Single GPU","created":"2021-10-19","cited_by_count":0,"area":null},{"id":"2111.05576","title":"Topic-aware latent models for representation learning on networks","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2112.01442","title":"Learning Large-scale Network Embedding from Representative Subgraph","created":"2021-12-02","cited_by_count":0,"area":null},{"id":"2209.08064","title":"A Systematic Evaluation of Node Embedding Robustness","created":"2022-09-16","cited_by_count":0,"area":null},{"id":"2210.11174","title":"Overlapping Community Detection using Dynamic Dilated Aggregation in Deep Residual GCN","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2402.03025","title":"Understanding and Guiding Weakly Supervised Entity Alignment with Potential Isomorphism Propagation","created":"2024-02-05","cited_by_count":0,"area":null},{"id":"2403.00032","title":"Time to Cite: Modeling Citation Networks using the Dynamic Impact Single-Event Embedding Model","created":"2024-02-28","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":"2405.19649","title":"Towards Deeper Understanding of PPR-based Embedding Approaches: A Topological Perspective","created":"2024-05-30","cited_by_count":0,"area":null},{"id":"2412.10789","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","created":"2024-12-14","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":"2602.01922","title":"Embedding Learning on Multiplex Networks for Link Prediction","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2604.08492","title":"The Impact of Dimensionality on the Stability of Node Embeddings","created":"2026-04-09","cited_by_count":0,"area":null},{"id":"2606.22180","title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","created":"2026-06-20","cited_by_count":0,"area":null}],"next_cursor":null}