{"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/unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","arxiv_id":"1904.01098","date":"2019-04-01","proceeding":null,"authors":["Yunsheng Bai","Hao Ding","Yang Qiao","Agustin Marinovic","Ken Gu","Ting Chen","Yizhou Sun","Wei Wang"],"abstract":"We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Scale Node Attention (MSNA), is proposed. Experiments on five real graph datasets show that UGRAPHEMB achieves competitive accuracy in the tasks of graph classification, similarity ranking, and graph visualization.","url_abs":"https://arxiv.org/abs/1904.01098v2","url_pdf":"https://arxiv.org/pdf/1904.01098v2.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":"unsupervised-inductive-whole-graph-embedding","repo_url":"https://github.com/yunshengb/UGraphEmb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"graph-similarity","task_name":"Graph Similarity"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset":"IMDb-M","model":"UGraphEmb-F","rank_in_archive_order":17,"of":36,"metrics":{"Accuracy":"50.97%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset":"IMDb-M","model":"UGraphEmb","rank_in_archive_order":23,"of":36,"metrics":{"Accuracy":"50.06%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci109","task":"Graph Classification","dataset":"NCI109","model":"UGraphEmb-F","rank_in_archive_order":29,"of":38,"metrics":{"Accuracy":"74.48"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci109","task":"Graph Classification","dataset":"NCI109","model":"UGraphEmb","rank_in_archive_order":36,"of":38,"metrics":{"Accuracy":"69.17"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"UGraphEmb-F","rank_in_archive_order":5,"of":37,"metrics":{"Accuracy":"73.56%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"UGraphEmb","rank_in_archive_order":10,"of":37,"metrics":{"Accuracy":"72.54%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-multi-12k","task":"Graph Classification","dataset":"REDDIT-MULTI-12K","model":"UGraphEmb-F","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"41.84"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-reddit-multi-12k","task":"Graph Classification","dataset":"REDDIT-MULTI-12K","model":"UGraphEmb","rank_in_archive_order":3,"of":3,"metrics":{"Accuracy":"39.97"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-web","task":"Graph Classification","dataset":"Web","model":"UGraphEmb-F","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"45.03"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.01098","atlas_url":"https://app.syntology.ai/?focus=1904.01098","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":"1904.01098"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.01098\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.01098"},"call":"get_concepts_for_paper(arxiv_id=\"1904.01098\")"}],"by_repo":[{"repo":"yunshengb/UGraphEmb","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":"c35c38343383b8dca8cce07c34e79193a19e4703c39d366b23f6ecf74a3e35a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}