{"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/neighborhood-homophily-guided-graph-1","title":"Neighborhood Homophily-Guided Graph Convolutional Network","arxiv_id":null,"date":"2023-10-21","proceeding":"CIKM 2023 10","authors":["Shengbo Gong","Jiajun Zhou","Chenxuan Xie","Qi Xuan"],"abstract":"Graph neural networks (GNNs) have been proved powerful in\r\ngraph-oriented tasks. However, many real-world graphs are heterophilous, challenging the homophily assumption of classical\r\nGNNs. To solve the universality problem, many studies deepen\r\nnetworks or concatenate intermediate representations, which does\r\nnot inherently change neighbor aggregation and introduces noise.\r\nRecent studies propose new metrics to characterize the homophily,\r\nbut rarely consider the correlation of the proposed metrics and\r\nmodels. In this paper, we first design a new metric, Neighborhood\r\nHomophily (NH), to measure the label complexity or purity in\r\nnode neighborhoods. Furthermore, we incorporate the metric into\r\nthe classical graph convolutional network (GCN) architecture and\r\npropose Neighborhood Homophily-based Graph Convolutional\r\nNetwork (NHGCN). In this framework, neighbors are grouped by\r\nestimated NH values and aggregated from different channels, and\r\nthe resulting node predictions are then used in turn to estimate\r\nand update NH values. The two processes of metric estimation and\r\nmodel inference are alternately optimized to achieve better node\r\nclassification. NHGCN achieves top overall performance on both\r\nhomophilous and heterophilous benchmarks, with an improvement\r\nof up to 7.4% compared to the current SOTA methods","url_abs":"https://dl.acm.org/doi/10.1145/3583780.3615195","url_pdf":"https://arxiv.org/pdf/2301.09851","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":"neighborhood-homophily-guided-graph-1","repo_url":"https://github.com/rockcor/NHGCN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-film-60-20-20-random","task":"Node Classification","dataset":"Film (60%/20%/20% random splits)","model":"NHGCN","rank_in_archive_order":2,"of":37,"metrics":{"1:1 Accuracy":"43.94 ± 1.14"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-60-20-20-random","task":"Node Classification","dataset":"PubMed (60%/20%/20% random splits)","model":"NHGCN","rank_in_archive_order":2,"of":37,"metrics":{"1:1 Accuracy":"91.56 ± 0.50"},"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":"rockcor/NHGCN","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":"f397e954f8195fdea32a152f22d9f045b1cae954e6e3a8757c1095bb46656d3b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}