{"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/node-oriented-spectral-filtering-for-graph","title":"Node-oriented Spectral Filtering for Graph Neural Networks","arxiv_id":"2212.03654","date":"2022-12-07","proceeding":null,"authors":["Shuai Zheng","Zhenfeng Zhu","Zhizhe Liu","Youru Li","Yao Zhao"],"abstract":"Graph neural networks (GNNs) have shown remarkable performance on homophilic graph data while being far less impressive when handling non-homophilic graph data due to the inherent low-pass filtering property of GNNs. In general, since real-world graphs are often complex mixtures of diverse subgraph patterns, learning a universal spectral filter on the graph from the global perspective as in most current works may still suffer from great difficulty in adapting to the variation of local patterns. On the basis of the theoretical analysis of local patterns, we rethink the existing spectral filtering methods and propose the node-oriented spectral filtering for graph neural network (namely NFGNN). By estimating the node-oriented spectral filter for each node, NFGNN is provided with the capability of precise local node positioning via the generalized translated operator, thus discriminating the variations of local homophily patterns adaptively. Meanwhile, the utilization of re-parameterization brings a good trade-off between global consistency and local sensibility for learning the node-oriented spectral filters. Furthermore, we theoretically analyze the localization property of NFGNN, demonstrating that the signal after adaptive filtering is still positioned around the corresponding node. Extensive experimental results demonstrate that the proposed NFGNN achieves more favorable performance.","url_abs":"https://arxiv.org/abs/2212.03654v3","url_pdf":"https://arxiv.org/pdf/2212.03654v3.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":"node-oriented-spectral-filtering-for-graph","repo_url":"https://github.com/SsGood/NFGNN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-chameleon-60-20-20","task":"Node Classification","dataset":"Chameleon (60%/20%/20% random splits)","model":"NFGNN","rank_in_archive_order":7,"of":38,"metrics":{"1:1 Accuracy":"72.52±0.59"},"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":"NFGNN","rank_in_archive_order":20,"of":37,"metrics":{"1:1 Accuracy":"89.89±0.68"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-squirrel-60-20-20","task":"Node Classification","dataset":"Squirrel (60%/20%/20% random splits)","model":"NFGNN","rank_in_archive_order":6,"of":37,"metrics":{"1:1 Accuracy":"58.9±0.35"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-texas-60-20-20-random","task":"Node Classification","dataset":"Texas (60%/20%/20% random splits)","model":"NFGNN","rank_in_archive_order":10,"of":36,"metrics":{"1:1 Accuracy":"94.03±0.82"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2212.03654","atlas_url":"https://app.syntology.ai/?focus=2212.03654","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":"2212.03654"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2212.03654\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2212.03654"},"call":"get_concepts_for_paper(arxiv_id=\"2212.03654\")"}],"by_repo":[{"repo":"SsGood/NFGNN","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":"dac02df20662658f9a459844033024bafe88315930f5d3385bf76949bd4c63cd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}