{"total":19,"rows":[{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2111.05941","title":"Generalizable Cross-Graph Embedding for GNN-based Congestion Prediction","created":"2021-11-10","cited_by_count":17,"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":"2105.08909","title":"Learning Graph Meta Embeddings for Cold-Start Ads in Click-Through Rate Prediction","created":"2021-05-19","cited_by_count":13,"area":null},{"id":"2402.02464","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","created":"2024-02-04","cited_by_count":10,"area":null},{"id":"2102.13582","title":"Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding","created":"2021-02-26","cited_by_count":9,"area":null},{"id":"2302.02909","title":"Spectral Augmentations for Graph Contrastive Learning","created":"2023-02-06","cited_by_count":8,"area":null},{"id":"2102.08532","title":"DeepWalking Backwards: From Embeddings Back to Graphs","created":"2021-02-17","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":"2407.15452","title":"GraphScale: A Framework to Enable Machine Learning over Billion-node Graphs","created":"2024-07-22","cited_by_count":4,"area":null},{"id":"2410.10743","title":"From Anchors to Answers: A Novel Node Tokenizer for Integrating Graph Structure into Large Language Models","created":"2024-10-14","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":"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":"2411.15458","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","created":"2024-11-23","cited_by_count":2,"area":null},{"id":"2112.04274","title":"On the Use of Unrealistic Predictions in Hundreds of Papers Evaluating Graph Representations","created":"2021-12-08","cited_by_count":1,"area":null},{"id":"2410.21043","title":"Disentangled and Self-Explainable Node Representation Learning","created":"2024-10-28","cited_by_count":1,"area":null},{"id":"2207.11321","title":"A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings","created":"2022-07-22","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":"2410.20248","title":"Convergence Guarantees for the DeepWalk Embedding on Block Models","created":"2024-10-26","cited_by_count":0,"area":null}],"next_cursor":null}