{"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/view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","arxiv_id":null,"date":"2022-03-17","proceeding":"IEEE Transactions on Cybernetics 2022 3","authors":["Liao","Zhuolin; Zhang","Xiaolin ; Su","Wei; Zhan","Kun;"],"abstract":"Performing transductive learning on graphs with very few labeled data, that is, two or three samples for each category, is challenging due to the lack of supervision. In the existing work, self-supervised learning via a single view model is widely adopted to address the problem. However, recent observation shows multiview representations of an object share the same semantic information in high-level feature space. For each sample, we generate heterogeneous representations and use view-consistency loss to make their representations consistent with each other. Multiview representation also inspires to supervise the pseudolabels generation by the aid of mutual supervision between views. In this article, we thus propose a view-consistent heterogeneous network (VCHN) to learn better representations by aligning view-agnostic semantics. Specifically, VCHN is constructed by constraining the predictions between two views so that the view pairs can supervise each other. To make the best use of cross-view information, we further propose a novel training strategy to generate more reliable pseudolabels, which thus enhances predictions of the VCHN. Extensive experimental results on three benchmark datasets demonstrate that our method achieves superior performance over state-of-the-art methods under very low label rates.","url_abs":"https://doi.org/10.1109/TCYB.2022.3157771","url_pdf":"https://doi.org/10.1109/TCYB.2022.3157771","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":"view-consistent-heterogeneous-network-on","repo_url":"https://github.com/kunzhan/VCHN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"},{"task_slug":"transductive-learning","task_name":"Transductive Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-citeseer-05","task":"Node Classification","dataset":"CiteSeer (0.5%)","model":"VCHN","rank_in_archive_order":2,"of":14,"metrics":{"Accuracy":"65.6%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer-1","task":"Node Classification","dataset":"CiteSeer (1%)","model":"VCHN","rank_in_archive_order":1,"of":14,"metrics":{"Accuracy":"70.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-05","task":"Node Classification","dataset":"Cora (0.5%)","model":"VCHN","rank_in_archive_order":2,"of":15,"metrics":{"Accuracy":"74.9%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-1","task":"Node Classification","dataset":"Cora (1%)","model":"VHCN","rank_in_archive_order":3,"of":15,"metrics":{"Accuracy":"78.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora-3","task":"Node Classification","dataset":"Cora (3%)","model":"VCHN","rank_in_archive_order":2,"of":15,"metrics":{"Accuracy":"83.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-003","task":"Node Classification","dataset":"PubMed (0.03%)","model":"VCHN","rank_in_archive_order":1,"of":14,"metrics":{"Accuracy":"71.8%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-005","task":"Node Classification","dataset":"PubMed (0.05%)","model":"VCHN","rank_in_archive_order":1,"of":14,"metrics":{"Accuracy":"74.3%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed-01","task":"Node Classification","dataset":"PubMed (0.1%)","model":"VCHN","rank_in_archive_order":2,"of":14,"metrics":{"Accuracy":"76.8%"},"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":"kunzhan/VCHN","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":"66c4758b9f9e556c339bd515b09055e9572ac615de52d17b3b86705f610c0d3c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}