{"url":"/method/grarep","slug":"grarep","name":"GraRep","full_name":"Graph Representation with Global structure","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"GraRep: Learning Graph Representations with Global Structural Information","paper":"/paper/grarep-learning-graph-representations-with","first_author":"Shaosheng Cao","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/grarep-learning-graph-representations-with"},"source":{"url":"https://www.researchgate.net/publication/301417811_GraRep","title":"GraRep: Learning Graph Representations with Global Structural Information","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":"/paper/classic-graph-structural-features-outperform","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","date":"2022-01-20","arxiv_id":"2201.08481","n_code_links":1,"syntology":null},{"paper":null,"title":"REFINE: Random RangE FInder for Network Embedding","date":"2021-08-24","arxiv_id":"2108.10703","n_code_links":0,"syntology":null},{"paper":"/paper/network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","n_code_links":1,"syntology":null},{"paper":"/paper/spectral-network-embedding-a-fast-and","title":"Spectral Network Embedding: A Fast and Scalable Method via Sparsity","date":"2018-06-07","arxiv_id":"1806.02623","n_code_links":1,"syntology":null},{"paper":"/paper/grarep-learning-graph-representations-with","title":"GraRep: Learning Graph Representations with Global Structural Information","date":"2015-10-17","arxiv_id":null,"n_code_links":2,"syntology":null}],"papers_shown":5,"tasks":[{"task":"/task/node-classification","name":"Node Classification","papers":4},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/link-prediction","name":"Link Prediction","papers":2},{"task":"/task/network-embedding","name":"Network Embedding","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/community-detection","name":"Community Detection","papers":1},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2015","papers":1},{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/grarep"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}