{"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/knowledge-graph-fact-prediction-via-knowledge","title":"Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization","arxiv_id":"1902.03077","date":"2019-02-08","proceeding":"Journal of Web Semantics 2019 12","authors":["Ankur Padia","Kostantinos Kalpakis","Francis Ferraro","Tim Finin"],"abstract":"We present a family of novel methods for embedding knowledge graphs into\nreal-valued tensors. These tensor-based embeddings capture the ordered\nrelations that are typical in the knowledge graphs represented by semantic web\nlanguages like RDF. Unlike many previous models, our methods can easily use\nprior background knowledge provided by users or extracted automatically from\nexisting knowledge graphs. In addition to providing more robust methods for\nknowledge graph embedding, we provide a provably-convergent, linear tensor\nfactorization algorithm. We demonstrate the efficacy of our models for the task\nof predicting new facts across eight different knowledge graphs, achieving\nbetween 5% and 50% relative improvement over existing state-of-the-art\nknowledge graph embedding techniques. Our empirical evaluation shows that all\nof the tensor decomposition models perform well when the average degree of an\nentity in a graph is high, with constraint-based models doing better on graphs\nwith a small number of highly similar relations and regularization-based models\ndominating for graphs with relations of varying degrees of similarity.","url_abs":"http://arxiv.org/abs/1902.03077v1","url_pdf":"http://arxiv.org/pdf/1902.03077v1.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":"knowledge-graph-fact-prediction-via-knowledge","repo_url":"https://github.com/Ebiquity/KGFP","is_official":1,"mentioned_in_paper":0,"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":"tensor-decomposition","task_name":"Tensor Decomposition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.03077","atlas_url":"https://app.syntology.ai/?focus=1902.03077","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":"1902.03077"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.03077\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.03077"},"call":"get_concepts_for_paper(arxiv_id=\"1902.03077\")"}],"by_repo":[{"repo":"Ebiquity/KGFP","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":"eb143146e197d6bf1496fd44a11add30f88a7074c87db277fdcf1af87acbe18f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}