{"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/gpsp-graph-partition-and-space-projection","title":"GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding","arxiv_id":"1803.02590","date":"2018-03-07","proceeding":null,"authors":["Wenyu Du","Shuai Yu","Min Yang","Qiang Qu","Jia Zhu"],"abstract":"In this paper, we propose GPSP, a novel Graph Partition and Space Projection\nbased approach, to learn the representation of a heterogeneous network that\nconsists of multiple types of nodes and links. Concretely, we first partition\nthe heterogeneous network into homogeneous and bipartite subnetworks. Then, the\nprojective relations hidden in bipartite subnetworks are extracted by learning\nthe projective embedding vectors. Finally, we concatenate the projective\nvectors from bipartite subnetworks with the ones learned from homogeneous\nsubnetworks to form the final representation of the heterogeneous network.\nExtensive experiments are conducted on a real-life dataset. The results\ndemonstrate that GPSP outperforms the state-of-the-art baselines in two key\nnetwork mining tasks: node classification and clustering.","url_abs":"http://arxiv.org/abs/1803.02590v1","url_pdf":"http://arxiv.org/pdf/1803.02590v1.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":"gpsp-graph-partition-and-space-projection","repo_url":"https://github.com/Ange1o/GPSP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"network-embedding","task_name":"Network Embedding"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Ange1o/GPSP","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":"03bcfc6386c790b54ae2714b70b60b07d4662b2be2f0cec1a02239cd6c2d89a4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}