{"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/multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","arxiv_id":null,"date":"2024-03-04","proceeding":"International Conference on Distributed Computing and High Performance Computing (DCHPC) 2024 3","authors":["Parsa Haddadian","Roya Booryaee","Rooholah Abedian","Ali Moeini"],"abstract":"Over the past ten years, graph representation learning has garnered a lot of attention due to the variety of graph-structured data and its efficiency in both time and space. One essential method for obtaining effective graph representations is graph pooling. Numerous studies on the graph pooling technique have been conducted. Cutting-edge results on a range of graph representation learning tasks were made possible by the combination of graph neural networks and self-attention mechanisms. Nevertheless, the attention mechanism has limitations since it ignores nodes that have no direct connection via an edge but provide valuable network context information. This paper proposes a graph pooling approach based on Personalized PageRank and self-attention, which improves the model to take into account both node properties and graph structure. The experimental findings indicate that, with a suitable number of parameters, the MAGPool approach delivers greater accuracy on the benchmark datasets.","url_abs":"https://ieeexplore.ieee.org/document/10454077","url_pdf":"https://ieeexplore.ieee.org/document/10454077","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":"multi-hop-attention-based-graph-pooling-a","repo_url":"https://github.com/p-haddadian/MAGPool","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-dd","task":"Graph Classification","dataset":"D&D","model":"MAGPool","rank_in_archive_order":15,"of":53,"metrics":{"Accuracy":"79.83%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-frankenstein","task":"Graph Classification","dataset":"FRANKENSTEIN","model":"MAGPool","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"67.21"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci1","task":"Graph Classification","dataset":"NCI1","model":"MAGPool","rank_in_archive_order":60,"of":69,"metrics":{"Accuracy":"72.32%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci109","task":"Graph Classification","dataset":"NCI109","model":"MAGPool","rank_in_archive_order":32,"of":38,"metrics":{"Accuracy":"73.43%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"MAGPool","rank_in_archive_order":10,"of":103,"metrics":{"Accuracy":"80.36%"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"p-haddadian/MAGPool","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":"865684b4261c0a5b97853bfad464e426c8e6d6019e8a3b2cfbd214115042eaca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}