{"total":47,"rows":[{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2208.06129","title":"Multiplex Heterogeneous Graph Convolutional Network","created":"2022-08-12","cited_by_count":27,"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":"2402.15810","title":"OAG-Bench: A Human-Curated Benchmark for Academic Graph Mining","created":"2024-02-24","cited_by_count":14,"area":null},{"id":"2103.00959","title":"CogDL: A Comprehensive Library for Graph Deep Learning","created":"2021-03-01","cited_by_count":12,"area":null},{"id":"2108.10703","title":"REFINE: Random RangE FInder for Network Embedding","created":"2021-08-24","cited_by_count":9,"area":null},{"id":"2204.05885","title":"A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations","created":"2022-04-12","cited_by_count":9,"area":null},{"id":"2109.09587","title":"Recommender systems based on graph embedding techniques: A comprehensive review","created":"2021-09-20","cited_by_count":8,"area":null},{"id":"2307.11981","title":"Collaborative Graph Neural Networks for Attributed Network Embedding","created":"2023-07-22","cited_by_count":8,"area":null},{"id":"2402.16009","title":"PST-Bench: Tracing and Benchmarking the Source of Publications","created":"2024-02-25","cited_by_count":7,"area":null},{"id":"2405.11922","title":"Effective Clustering on Large Attributed Bipartite Graphs","created":"2024-05-20","cited_by_count":7,"area":null},{"id":"2106.10620","title":"Large-Scale Network Embedding in Apache Spark","created":"2021-06-20","cited_by_count":6,"area":null},{"id":"2210.01944","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","created":"2022-10-04","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":"2501.04570","title":"Large-Scale Spectral Graph Neural Networks via Laplacian Sparsification: Technical Report","created":"2025-01-08","cited_by_count":5,"area":null},{"id":"2104.08737","title":"Low-Rank Subspaces for Unsupervised Entity Linking","created":"2021-04-18","cited_by_count":4,"area":null},{"id":"2107.08379","title":"A Survey on Role-Oriented Network Embedding","created":"2021-07-18","cited_by_count":4,"area":null},{"id":"2204.06963","title":"Finding MNEMON: Reviving Memories of Node Embeddings","created":"2022-04-14","cited_by_count":4,"area":null},{"id":"2312.13068","title":"Continuous-time Graph Representation with Sequential Survival Process","created":"2023-12-20","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":"2111.10772","title":"Network representation learning: A macro and micro view","created":"2021-11-21","cited_by_count":3,"area":null},{"id":"2310.11060","title":"Privacy-Preserving Graph Embedding based on Local Differential Privacy","created":"2023-10-17","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":"2111.11335","title":"Towards Improving Embedding Based Models of Social Network Alignment via Pseudo Anchors","created":"2021-11-22","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":"2505.20992","title":"Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation","created":"2025-05-27","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":"2111.04826","title":"Inferential SIR-GN: Scalable Graph Representation Learning","created":"2021-11-08","cited_by_count":1,"area":null},{"id":"2207.10149","title":"Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphs","created":"2022-07-20","cited_by_count":1,"area":null},{"id":"2210.07871","title":"One Graph to Rule them All: Using NLP and Graph Neural Networks to analyse Tolkien's Legendarium","created":"2022-10-14","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":"2106.01858","title":"Statistical embedding: Beyond principal components","created":"2021-06-03","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":"2206.11959","title":"Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training","created":"2022-06-23","cited_by_count":0,"area":null},{"id":"2207.01189","title":"Learning node embeddings via summary graphs: a brief theoretical analysis","created":"2022-07-04","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":"2308.15293","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks","created":"2023-08-29","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":"2409.16623","title":"On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction","created":"2024-09-25","cited_by_count":0,"area":null},{"id":"2602.11607","title":"Scene-Aware Memory Discrimination: Deciding Which Personal Knowledge Stays","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2609.08152","title":"Topology-induced Operators Reveal Complementary Graph Representations without Training","created":"2026-09-08","cited_by_count":0,"area":null}],"next_cursor":null}