{"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/neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","arxiv_id":"1905.08509","date":"2019-05-21","proceeding":null,"authors":["Xinhan Di","Pengqian Yu","Rui Bu","Mingchao Sun"],"abstract":"A variety of graph neural networks (GNNs) frameworks for representation learning on graphs have been recently developed. These frameworks rely on aggregation and iteration scheme to learn the representation of nodes. However, information between nodes is inevitably lost in the scheme during learning. In order to reduce the loss, we extend the GNNs frameworks by exploring the aggregation and iteration scheme in the methodology of mutual information. We propose a new approach of enlarging the normal neighborhood in the aggregation of GNNs, which aims at maximizing mutual information. Based on a series of experiments conducted on several benchmark datasets, we show that the proposed approach improves the state-of-the-art performance for four types of graph tasks, including supervised and semi-supervised graph classification, graph link prediction and graph edge generation and classification.","url_abs":"https://arxiv.org/abs/1905.08509v4","url_pdf":"https://arxiv.org/pdf/1905.08509v4.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":"neighborhood-enlargement-in-graph-neural","repo_url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"neighborhood-enlargement-in-graph-neural","repo_url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-20news","task":"Graph Classification","dataset":"20NEWS","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"47.9"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"sGIN","rank_in_archive_order":10,"of":39,"metrics":{"Accuracy":"80.71%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-cancer","task":"Graph Classification","dataset":"Cancer","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"95.7"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-citeseer","task":"Graph Classification","dataset":"Citeseer","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"73.7"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-cora","task":"Graph Classification","dataset":"Cora","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"72.3"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-digits","task":"Graph Classification","dataset":"Digits","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"92.5"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-b","task":"Graph Classification","dataset":"IMDb-B","model":"sGIN","rank_in_archive_order":14,"of":51,"metrics":{"Accuracy":"77.94%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset":"IMDb-M","model":"sGIN","rank_in_archive_order":7,"of":36,"metrics":{"Accuracy":"54.52%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"sGIN","rank_in_archive_order":8,"of":74,"metrics":{"Accuracy":"94.14%"},"uses_additional_data":true},{"leaderboard":"/sota/graph-classification-on-nci1","task":"Graph Classification","dataset":"NCI1","model":"sGIN","rank_in_archive_order":24,"of":69,"metrics":{"Accuracy":"83.85%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"sGIN","rank_in_archive_order":13,"of":103,"metrics":{"Accuracy":"78.97%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"sGIN","rank_in_archive_order":6,"of":37,"metrics":{"Accuracy":"73.56%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-wine","task":"Graph Classification","dataset":"Wine","model":"sKNN-LDS","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"98"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-pubmed","task":"Link Prediction","dataset":"Pubmed","model":"sGraphite-VAE","rank_in_archive_order":9,"of":13,"metrics":{"AP":"96.3%","AUC":"94.8%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.08509","atlas_url":"https://app.syntology.ai/?focus=1905.08509","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":"1905.08509"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.08509\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.08509"},"call":"get_concepts_for_paper(arxiv_id=\"1905.08509\")"}],"by_repo":[{"repo":"CODE-SUBMIT/Graph_Neighborhood_1","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","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":"21b499310481696fa4ff9f9089ce3d98dc99837e71fc35170901e249752630d7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}