{"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/attention-models-in-graphs-a-survey","title":"Attention Models in Graphs: A Survey","arxiv_id":"1807.07984","date":"2018-07-20","proceeding":null,"authors":["John Boaz Lee","Ryan A. Rossi","Sungchul Kim","Nesreen K. Ahmed","Eunyee Koh"],"abstract":"Graph-structured data arise naturally in many different application domains.\nBy representing data as graphs, we can capture entities (i.e., nodes) as well\nas their relationships (i.e., edges) with each other. Many useful insights can\nbe derived from graph-structured data as demonstrated by an ever-growing body\nof work focused on graph mining. However, in the real-world, graphs can be both\nlarge - with many complex patterns - and noisy which can pose a problem for\neffective graph mining. An effective way to deal with this issue is to\nincorporate \"attention\" into graph mining solutions. An attention mechanism\nallows a method to focus on task-relevant parts of the graph, helping it to\nmake better decisions. In this work, we conduct a comprehensive and focused\nsurvey of the literature on the emerging field of graph attention models. We\nintroduce three intuitive taxonomies to group existing work. These are based on\nproblem setting (type of input and output), the type of attention mechanism\nused, and the task (e.g., graph classification, link prediction, etc.). We\nmotivate our taxonomies through detailed examples and use each to survey\ncompeting approaches from a unique standpoint. Finally, we highlight several\nchallenges in the area and discuss promising directions for future work.","url_abs":"http://arxiv.org/abs/1807.07984v1","url_pdf":"http://arxiv.org/pdf/1807.07984v1.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":"attention-models-in-graphs-a-survey","repo_url":"https://github.com/zhliping/Deep-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-mining","task_name":"Graph Mining"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"survey","task_name":"Survey"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.07984","atlas_url":"https://app.syntology.ai/?focus=1807.07984","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":"1807.07984"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.07984\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.07984"},"call":"get_concepts_for_paper(arxiv_id=\"1807.07984\")"}],"by_repo":[{"repo":"zhliping/Deep-Learning","kind":"listed","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":"ee666deb6ed57de7a27182a0a218b23e0cb38a86023e0fea19097b17b96d12ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}