{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/edge-attention-based-multi-relational-graph","title":"Edge Attention-based Multi-Relational Graph Convolutional Networks","arxiv_id":"1802.04944","date":"2018-02-14","proceeding":null,"authors":["Chao Shang","Qinqing Liu","Ko-Shin Chen","Jiangwen Sun","Jin Lu","Jin-Feng Yi","Jinbo Bi"],"abstract":"Graph convolutional network (GCN) is generalization of convolutional neural\nnetwork (CNN) to work with arbitrarily structured graphs. A binary adjacency\nmatrix is commonly used in training a GCN. Recently, the attention mechanism\nallows the network to learn a dynamic and adaptive aggregation of the\nneighborhood. We propose a new GCN model on the graphs where edges are\ncharacterized in multiple views or precisely in terms of multiple\nrelationships. For instance, in chemical graph theory, compound structures are\noften represented by the hydrogen-depleted molecular graph where nodes\ncorrespond to atoms and edges correspond to chemical bonds. Multiple attributes\ncan be important to characterize chemical bonds, such as atom pair (the types\nof atoms that a bond connects), aromaticity, and whether a bond is in a ring.\nThe different attributes lead to different graph representations for the same\nmolecule. There is growing interests in both chemistry and machine learning\nfields to directly learn molecular properties of compounds from the molecular\ngraph, instead of from fingerprints predefined by chemists. The proposed GCN\nmodel, which we call edge attention-based multi-relational GCN (EAGCN), jointly\nlearns attention weights and node features in graph convolution. For each bond\nattribute, a real-valued attention matrix is used to replace the binary\nadjacency matrix. By designing a dictionary for the edge attention, and forming\nthe attention matrix of each molecule by looking up the dictionary, the EAGCN\nexploits correspondence between bonds in different molecules. The prediction of\ncompound properties is based on the aggregated node features, which is\nindependent of the varying molecule (graph) size. We demonstrate the efficacy\nof the EAGCN on multiple chemical datasets: Tox21, HIV, Freesolv, and\nLipophilicity, and interpret the resultant attention weights.","url_abs":"http://arxiv.org/abs/1802.04944v2","url_pdf":"http://arxiv.org/pdf/1802.04944v2.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":"edge-attention-based-multi-relational-graph","repo_url":"https://github.com/Luckick/EAGCN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"}],"methods":[{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.04944","atlas_url":"https://app.syntology.ai/?focus=1802.04944","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1802.04944"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.04944\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.04944"},"call":"get_concepts_for_paper(arxiv_id=\"1802.04944\")"}],"by_repo":[{"repo":"Luckick/EAGCN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"590ede173e0de726a64d6e02ca84078123639f9a82eed3da55aee0ba62c2b65a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}