{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/predicting-the-silent-majority-on-graphs","title":"Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network","arxiv_id":"2302.00873","date":"2023-02-02","proceeding":null,"authors":["Wendong Bi","Bingbing Xu","Xiaoqian Sun","Li Xu","HuaWei Shen","Xueqi Cheng"],"abstract":"Graphs consisting of vocal nodes (\"the vocal minority\") and silent nodes (\"the silent majority\"), namely VS-Graph, are ubiquitous in the real world. The vocal nodes tend to have abundant features and labels. In contrast, silent nodes only have incomplete features and rare labels, e.g., the description and political tendency of politicians (vocal) are abundant while not for ordinary people (silent) on the twitter's social network. Predicting the silent majority remains a crucial yet challenging problem. However, most existing message-passing based GNNs assume that all nodes belong to the same domain, without considering the missing features and distribution-shift between domains, leading to poor ability to deal with VS-Graph. To combat the above challenges, we propose Knowledge Transferable Graph Neural Network (KT-GNN), which models distribution shifts during message passing and representation learning by transferring knowledge from vocal nodes to silent nodes. Specifically, we design the domain-adapted \"feature completion and message passing mechanism\" for node representation learning while preserving domain difference. And a knowledge transferable classifier based on KL-divergence is followed. Comprehensive experiments on real-world scenarios (i.e., company financial risk assessment and political elections) demonstrate the superior performance of our method. Our source code has been open sourced.","url_abs":"https://arxiv.org/abs/2302.00873v3","url_pdf":"https://arxiv.org/pdf/2302.00873v3.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":"predicting-the-silent-majority-on-graphs","repo_url":"https://github.com/wendongbi/KT-GNN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2302.00873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00873"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wendongbi/KT-GNN","reach":null}],"summary":{"ran_honours":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"ed60114c5953cc5b","entry":"test","repo":"wendongbi/KT-GNN","repo_kind":"official","path":"KT-GNN/main_twitter.py","file_url":"https://github.com/wendongbi/KT-GNN/blob/HEAD/KT-GNN/main_twitter.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ed60114c5953cc5b"}},{"code_sha256_prefix":"106bd1b3345b702a","entry":"train","repo":"wendongbi/KT-GNN","repo_kind":"official","path":"KT-GNN/main_twitter.py","file_url":"https://github.com/wendongbi/KT-GNN/blob/HEAD/KT-GNN/main_twitter.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"106bd1b3345b702a"}},{"code_sha256_prefix":"4327be94dbd33166","entry":"get_each_clf_res","repo":"wendongbi/KT-GNN","repo_kind":"official","path":"KT-GNN/main_twitter.py","file_url":"https://github.com/wendongbi/KT-GNN/blob/HEAD/KT-GNN/main_twitter.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4327be94dbd33166"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}