{"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/pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","arxiv_id":null,"date":"2022-02-01","proceeding":"Neurocomputing 2022 2","authors":["Ge Fan","Biao Geng","Jianrong Tao","Kai Wang","Changjie Fan","Wei Zeng"],"abstract":"After being proved extremely useful in many applications, the network embedding has played a critical role in the network analysis. Most of recent works usually model the network by minimizing the joint probability that the target node co-occurs with its neighboring nodes. These methods may fail to capture the personalized informativeness of each vertex. In this work, we propose a method named Personalized Proximity Preserved Network Embedding (PPPNE) to adaptively capture the personalization of vertices based on the personalized ranking loss. Our theoretical analysis shows that PPPNE generalizes prior work based on the matrix factorization or the neural network with a single layer, and we argue that preserving personalized proximity is the key to learning more informative representations. Moreover, to better capture the network structure in multiple scales, we exploit the distance ordering of each vertex. Our method can be efficiently optimized with a vertex-anchored sampling strategy. The results of extensive experiments on five real-world networks demonstrate that our approach outperforms state-of-the-art network embedding methods with a considerable improvement on several common tasks including link prediction and vertex classification. Additionally, PPPNE is efficient and can be easily accelerated by parallel computing, which enables PPPNE to work on large-scale networks.","url_abs":"http://fange.pro/files/2021PPPNE.pdf","url_pdf":"http://fange.pro/files/2021PPPNE.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":[],"tasks":[{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"informativeness","task_name":"Informativeness"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-cora","task":"Link Prediction","dataset":"Cora","model":"PPPNE","rank_in_archive_order":10,"of":13,"metrics":{"AP":"93.9%","AUC":"92.5%"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-ppi","task":"Link Prediction","dataset":"PPI","model":"PPPNE","rank_in_archive_order":1,"of":2,"metrics":{"AP":"84.1%","AUC":"82.7%"},"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c63ceb1f128739b74d0231922e2101cb77432ee6b067e599ff7814a04488f628","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}