{"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-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","arxiv_id":"1711.11231","date":"2017-11-30","proceeding":null,"authors":["Shu Guo","Quan Wang","Lihong Wang","Bin Wang","Li Guo"],"abstract":"Embedding knowledge graphs (KGs) into continuous vector spaces is a focus of\ncurrent research. Combining such an embedding model with logic rules has\nrecently attracted increasing attention. Most previous attempts made a one-time\ninjection of logic rules, ignoring the interactive nature between embedding\nlearning and logical inference. And they focused only on hard rules, which\nalways hold with no exception and usually require extensive manual effort to\ncreate or validate. In this paper, we propose Rule-Guided Embedding (RUGE), a\nnovel paradigm of KG embedding with iterative guidance from soft rules. RUGE\nenables an embedding model to learn simultaneously from 1) labeled triples that\nhave been directly observed in a given KG, 2) unlabeled triples whose labels\nare going to be predicted iteratively, and 3) soft rules with various\nconfidence levels extracted automatically from the KG. In the learning process,\nRUGE iteratively queries rules to obtain soft labels for unlabeled triples, and\nintegrates such newly labeled triples to update the embedding model. Through\nthis iterative procedure, knowledge embodied in logic rules may be better\ntransferred into the learned embeddings. We evaluate RUGE in link prediction on\nFreebase and YAGO. Experimental results show that: 1) with rule knowledge\ninjected iteratively, RUGE achieves significant and consistent improvements\nover state-of-the-art baselines; and 2) despite their uncertainties,\nautomatically extracted soft rules are highly beneficial to KG embedding, even\nthose with moderate confidence levels. The code and data used for this paper\ncan be obtained from https://github.com/iieir-km/RUGE.","url_abs":"http://arxiv.org/abs/1711.11231v1","url_pdf":"http://arxiv.org/pdf/1711.11231v1.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-embedding-with-iterative","repo_url":"https://github.com/iieir-km/RUGE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"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"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-fb15k-1","task":"Link Prediction","dataset":"FB15k","model":"Rule-Guided Embedding","rank_in_archive_order":7,"of":10,"metrics":{"Hits@1":"0.703","Hits@10":"0.865","Hits@3":"0.815","Hits@5":"0.836","MRR":"0.768"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-yago37","task":"Link Prediction","dataset":"YAGO37","model":"Rule-Guided Embedding","rank_in_archive_order":2,"of":2,"metrics":{"Hits@1":"0.34","Hits@10":"0.603","Hits@3":"0.482","Hits@5":"0.541","MRR":"0.431"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.11231","atlas_url":"https://app.syntology.ai/?focus=1711.11231","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":"1711.11231"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.11231\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.11231"},"call":"get_concepts_for_paper(arxiv_id=\"1711.11231\")"}],"by_repo":[{"repo":"iieir-km/RUGE","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":"e0b38b0f835f65094097ddb578e83d89e1accfb9c8b0ce5a63c631a341ea785c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}