{"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/tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","arxiv_id":"1901.09590","date":"2019-01-28","proceeding":"IJCNLP 2019 11","authors":["Ivana Balažević","Carl Allen","Timothy M. Hospedales"],"abstract":"Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. TuckER outperforms previous state-of-the-art models across standard link prediction datasets, acting as a strong baseline for more elaborate models. We show that TuckER is a fully expressive model, derive sufficient bounds on its embedding dimensionalities and demonstrate that several previously introduced linear models can be viewed as special cases of TuckER.","url_abs":"https://arxiv.org/abs/1901.09590v2","url_pdf":"https://arxiv.org/pdf/1901.09590v2.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":"tucker-tensor-factorization-for-knowledge","repo_url":"https://github.com/ibalazevic/TuckER","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"tucker-tensor-factorization-for-knowledge","repo_url":"https://github.com/Sujit-O/pykg2vec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"tucker-tensor-factorization-for-knowledge","repo_url":"https://github.com/adaruna3/explainable-kge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"tucker-tensor-factorization-for-knowledge","repo_url":"https://github.com/allenai/kb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"tucker-tensor-factorization-for-knowledge","repo_url":"https://github.com/luffycodes/neptune","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[{"method_slug":"tucker","method_name":"TuckER"}],"datasets_introduced":[],"methods_introduced":[{"slug":"tucker","name":"TuckER","full_name":"TuckER"}],"results":[{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset":"FB15k","model":"TuckER","rank_in_archive_order":9,"of":23,"metrics":{"Hits@1":"0.741","Hits@10":"0.892","Hits@3":"0.833","MRR":"0.795"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset":"FB15k-237","model":"TuckER","rank_in_archive_order":22,"of":75,"metrics":{"Hits@1":"0.266","Hits@10":"0.544","Hits@3":"0.394","MRR":"0.358"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"TuckER","rank_in_archive_order":10,"of":37,"metrics":{"Hits@1":"0.949","Hits@10":"0.958","Hits@3":"0.955","MRR":"0.953"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"TuckER","rank_in_archive_order":60,"of":75,"metrics":{"Hits@1":"0.443","Hits@10":"0.526","Hits@3":"0.482","MRR":"0.470"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.09590","atlas_url":"https://app.syntology.ai/?focus=1901.09590","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":"1901.09590"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.09590\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.09590"},"call":"get_concepts_for_paper(arxiv_id=\"1901.09590\")"}],"by_repo":[{"repo":"ibalazevic/TuckER","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Sujit-O/pykg2vec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"adaruna3/explainable-kge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"allenai/kb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.04711"],"harvested_for_calls":[{"arxiv_id":"2109.04711","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.04711"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.04711\")"}]},{"repo":"luffycodes/neptune","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"a632c5922518fe90099bf4062e68ffb25209cf22960cdcdfcf2ab7f258385d19","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}