{"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/joint-matrix-tensor-factorization-for","title":"Joint Matrix-Tensor Factorization for Knowledge Base Inference","arxiv_id":"1706.00637","date":"2017-06-02","proceeding":null,"authors":["Prachi Jain","Shikhar Murty","Mausam","Soumen Chakrabarti"],"abstract":"While several matrix factorization (MF) and tensor factorization (TF) models\nhave been proposed for knowledge base (KB) inference, they have rarely been\ncompared across various datasets. Is there a single model that performs well\nacross datasets? If not, what characteristics of a dataset determine the\nperformance of MF and TF models? Is there a joint TF+MF model that performs\nrobustly on all datasets? We perform an extensive evaluation to compare popular\nKB inference models across popular datasets in the literature. In addition to\nanswering the questions above, we remove a limitation in the standard\nevaluation protocol for MF models, propose an extension to MF models so that\nthey can better handle out-of-vocabulary (OOV) entity pairs, and develop a\nnovel combination of TF and MF models. We also analyze and explain the results\nbased on models and dataset characteristics. Our best model is robust, and\nobtains strong results across all datasets.","url_abs":"http://arxiv.org/abs/1706.00637v1","url_pdf":"http://arxiv.org/pdf/1706.00637v1.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":"joint-matrix-tensor-factorization-for","repo_url":"https://github.com/dair-iitd/kbi","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"joint-matrix-tensor-factorization-for","repo_url":"https://github.com/MurtyShikhar/KBI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"knowledge-base-completion","task_name":"Knowledge Base Completion"},{"task_slug":"knowledge-base-population","task_name":"Knowledge Base Population"},{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"knowledge-graph-embedding","task_name":"Knowledge Graph Embedding"},{"task_slug":"matrix-factorization-decomposition","task_name":"Matrix Factorization / Decomposition"}],"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":"dair-iitd/kbi","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MurtyShikhar/KBI","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":"85a381fbfc05f7c980b9202b194efc60800cea8b07a19ef795e9a3e9a57f038c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}