{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","arxiv_id":"2005.03675","date":"2020-05-07","proceeding":null,"authors":["Ines Chami","Sami Abu-El-Haija","Bryan Perozzi","Christopher Ré","Kevin Murphy"],"abstract":"There has been a surge of recent interest in learning representations for graph-structured data. Graph representation learning methods have generally fallen into three main categories, based on the availability of labeled data. The first, network embedding (such as shallow graph embedding or graph auto-encoders), focuses on learning unsupervised representations of relational structure. The second, graph regularized neural networks, leverages graphs to augment neural network losses with a regularization objective for semi-supervised learning. The third, graph neural networks, aims to learn differentiable functions over discrete topologies with arbitrary structure. However, despite the popularity of these areas there has been surprisingly little work on unifying the three paradigms. Here, we aim to bridge the gap between graph neural networks, network embedding and graph regularization models. We propose a comprehensive taxonomy of representation learning methods for graph-structured data, aiming to unify several disparate bodies of work. Specifically, we propose a Graph Encoder Decoder Model (GRAPHEDM), which generalizes popular algorithms for semi-supervised learning on graphs (e.g. GraphSage, Graph Convolutional Networks, Graph Attention Networks), and unsupervised learning of graph representations (e.g. DeepWalk, node2vec, etc) into a single consistent approach. To illustrate the generality of this approach, we fit over thirty existing methods into this framework. We believe that this unifying view both provides a solid foundation for understanding the intuition behind these methods, and enables future research in the area.","url_abs":"https://arxiv.org/abs/2005.03675v3","url_pdf":"https://arxiv.org/pdf/2005.03675v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"machine-learning-on-graphs-a-model-and","repo_url":"https://github.com/google/gcnn-survey-paper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"network-embedding","task_name":"Network Embedding"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"deepwalk","method_name":"DeepWalk"},{"method_slug":"graph-convolutional-networks","method_name":"Graph Convolutional Networks"},{"method_slug":"node2vec","method_name":"node2vec"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/google/gcnn-survey-paper","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":8},"by_repo_kind":{"official":{"samples":8,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"77bcd046571761c1","entry":"check_improve","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/train_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/train_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"77bcd046571761c1"}},{"code_sha256_prefix":"fd8b00272ec7743a","entry":"compute_lp_metrics","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/link_prediction_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/link_prediction_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"fd8b00272ec7743a"}},{"code_sha256_prefix":"45f146a4e032750d","entry":"format_metrics","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/train_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/train_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"45f146a4e032750d"}},{"code_sha256_prefix":"0b06ee2c27b2fcc8","entry":"format_params","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/train_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/train_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"0b06ee2c27b2fcc8"}},{"code_sha256_prefix":"4ec6a55939de645b","entry":"get_scores_from_generator","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/link_prediction_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/link_prediction_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"4ec6a55939de645b"}},{"code_sha256_prefix":"dbec99fa14be02fc","entry":"get_val_test_acc","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"best_model.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/best_model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"dbec99fa14be02fc"}},{"code_sha256_prefix":"7d96d513b36097cc","entry":"load_test_edge_mask","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/data_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/data_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"7d96d513b36097cc"}},{"code_sha256_prefix":"ddcf68e913917c2b","entry":"sparse_dropout","repo":"google/gcnn-survey-paper","repo_kind":"official","path":"utils/model_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/model_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ddcf68e913917c2b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}