{"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/label-enhanced-graph-neural-network-for-semi","title":"Label-Enhanced Graph Neural Network for Semi-supervised Node Classification","arxiv_id":"2205.15653","date":"2022-05-31","proceeding":null,"authors":["Le Yu","Leilei Sun","Bowen Du","Tongyu Zhu","Weifeng Lv"],"abstract":"Graph Neural Networks (GNNs) have been widely applied in the semi-supervised node classification task, where a key point lies in how to sufficiently leverage the limited but valuable label information. Most of the classical GNNs solely use the known labels for computing the classification loss at the output. In recent years, several methods have been designed to additionally utilize the labels at the input. One part of the methods augment the node features via concatenating or adding them with the one-hot encodings of labels, while other methods optimize the graph structure by assuming neighboring nodes tend to have the same label. To bring into full play the rich information of labels, in this paper, we present a label-enhanced learning framework for GNNs, which first models each label as a virtual center for intra-class nodes and then jointly learns the representations of both nodes and labels. Our approach could not only smooth the representations of nodes belonging to the same class, but also explicitly encode the label semantics into the learning process of GNNs. Moreover, a training node selection technique is provided to eliminate the potential label leakage issue and guarantee the model generalization ability. Finally, an adaptive self-training strategy is proposed to iteratively enlarge the training set with more reliable pseudo labels and distinguish the importance of each pseudo-labeled node during the model training process. Experimental results on both real-world and synthetic datasets demonstrate our approach can not only consistently outperform the state-of-the-arts, but also effectively smooth the representations of intra-class nodes.","url_abs":"https://arxiv.org/abs/2205.15653v2","url_pdf":"https://arxiv.org/pdf/2205.15653v2.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":"label-enhanced-graph-neural-network-for-semi","repo_url":"https://github.com/yule-BUAA/LEGNN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-property-prediction","task_name":"Node Property Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"LEGNN + AS-Train","rank_in_archive_order":39,"of":86,"metrics":{"Ext. data":"No","Number of params":"5374120","Test Accuracy":"0.7371 ± 0.0011","Validation Accuracy":"0.7494 ± 0.0008"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"LEGNN","rank_in_archive_order":45,"of":86,"metrics":{"Ext. data":"No","Number of params":"5374120","Test Accuracy":"0.7337 ± 0.0007","Validation Accuracy":"0.7480 ± 0.0009"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"LEGNN + AS-Train","rank_in_archive_order":20,"of":39,"metrics":{"Ext. data":"No","Number of params":"5147997","Test Accuracy":"0.5378 ± 0.0016","Validation Accuracy":"0.5528 ± 0.0013"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"LEGNN","rank_in_archive_order":21,"of":39,"metrics":{"Ext. data":"No","Number of params":"5147997","Test Accuracy":"0.5276 ± 0.0014","Validation Accuracy":"0.5443 ± 0.0009"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.15653","atlas_url":"https://app.syntology.ai/?focus=2205.15653","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":"2205.15653"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2205.15653\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2205.15653"},"call":"get_concepts_for_paper(arxiv_id=\"2205.15653\")"}],"by_repo":[{"repo":"yule-BUAA/LEGNN","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":"23499cbc4a125c630ce118c7cb36c8d49035685b08a6c74e5ff022d98a6990ce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}