{"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/n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","arxiv_id":"1802.08888","date":"2018-02-24","proceeding":null,"authors":["Sami Abu-El-Haija","Amol Kapoor","Bryan Perozzi","Joonseok Lee"],"abstract":"Graph Convolutional Networks (GCNs) have shown significant improvements in\nsemi-supervised learning on graph-structured data. Concurrently, unsupervised\nlearning of graph embeddings has benefited from the information contained in\nrandom walks. In this paper, we propose a model: Network of GCNs (N-GCN), which\nmarries these two lines of work. At its core, N-GCN trains multiple instances\nof GCNs over node pairs discovered at different distances in random walks, and\nlearns a combination of the instance outputs which optimizes the classification\nobjective. Our experiments show that our proposed N-GCN model improves\nstate-of-the-art baselines on all of the challenging node classification tasks\nwe consider: Cora, Citeseer, Pubmed, and PPI. In addition, our proposed method\nhas other desirable properties, including generalization to recently proposed\nsemi-supervised learning methods such as GraphSAGE, allowing us to propose\nN-SAGE, and resilience to adversarial input perturbations.","url_abs":"http://arxiv.org/abs/1802.08888v1","url_pdf":"http://arxiv.org/pdf/1802.08888v1.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":"n-gcn-multi-scale-graph-convolution-for-semi","repo_url":"https://github.com/samihaija/mixhop","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"graphsage","method_name":"GraphSAGE"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"N-GCN","rank_in_archive_order":44,"of":71,"metrics":{"Accuracy":"72.2%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"N-GCN","rank_in_archive_order":45,"of":73,"metrics":{"Accuracy":"83.0%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"N-GCN","rank_in_archive_order":44,"of":70,"metrics":{"Accuracy":"79.5%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.08888","atlas_url":"https://app.syntology.ai/?focus=1802.08888","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.08888"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.08888\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.08888"},"call":"get_concepts_for_paper(arxiv_id=\"1802.08888\")"}],"by_repo":[{"repo":"samihaija/mixhop","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":"874a2c3ef85d320517a8fa4523a2e144c2b332578bf9dae492a64e14095de535","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}