{"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/efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","arxiv_id":"1703.10316","date":"2017-03-30","proceeding":null,"authors":["Denghui Zhang","Manling Li","Yantao Jia","Yuanzhuo Wang","Xue-Qi Cheng"],"abstract":"Knowledge graph embedding aims to embed entities and relations of knowledge\ngraphs into low-dimensional vector spaces. Translating embedding methods regard\nrelations as the translation from head entities to tail entities, which achieve\nthe state-of-the-art results among knowledge graph embedding methods. However,\na major limitation of these methods is the time consuming training process,\nwhich may take several days or even weeks for large knowledge graphs, and\nresult in great difficulty in practical applications. In this paper, we propose\nan efficient parallel framework for translating embedding methods, called\nParTrans-X, which enables the methods to be paralleled without locks by\nutilizing the distinguished structures of knowledge graphs. Experiments on two\ndatasets with three typical translating embedding methods, i.e., TransE [3],\nTransH [17], and a more efficient variant TransE- AdaGrad [10] validate that\nParTrans-X can speed up the training process by more than an order of\nmagnitude.","url_abs":"http://arxiv.org/abs/1703.10316v4","url_pdf":"http://arxiv.org/pdf/1703.10316v4.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":"efficient-parallel-translating-embedding-for","repo_url":"https://github.com/zdh2292390/ParTrans-X","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"knowledge-graph-embedding","task_name":"Knowledge Graph Embedding"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"translation","task_name":"Translation"}],"methods":[{"method_slug":"adagrad","method_name":"AdaGrad"},{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"transe","method_name":"TransE"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-fb15k-1","task":"Link Prediction","dataset":"FB15k","model":"ParTransH","rank_in_archive_order":10,"of":10,"metrics":{"Hits@10":"0.468","MR":"60"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k-filtered","task":"Link Prediction","dataset":"FB15k (filtered)","model":"ParTransH","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"65.7","MR":"60"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"ParTransH","rank_in_archive_order":33,"of":37,"metrics":{"Hits@10":"0.668","MR":"215"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18-filtered","task":"Link Prediction","dataset":"WN18 (filtered)","model":"ParTransH","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"76.6","MR":"203"},"uses_additional_data":false}],"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":"zdh2292390/ParTrans-X","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":"7c35d60a6fa3108d7a5050df2caa6ed547f9aa099f019fea7a2f566708388e5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}