{"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/does-william-shakespeare-really-write-hamlet","title":"Does William Shakespeare REALLY Write Hamlet? Knowledge Representation Learning with Confidence","arxiv_id":"1705.03202","date":"2017-05-09","proceeding":null,"authors":["Ruobing Xie","Zhiyuan Liu","Fen Lin","Leyu Lin"],"abstract":"Knowledge graphs (KGs), which could provide essential relational information\nbetween entities, have been widely utilized in various knowledge-driven\napplications. Since the overall human knowledge is innumerable that still grows\nexplosively and changes frequently, knowledge construction and update\ninevitably involve automatic mechanisms with less human supervision, which\nusually bring in plenty of noises and conflicts to KGs. However, most\nconventional knowledge representation learning methods assume that all triple\nfacts in existing KGs share the same significance without any noises. To\naddress this problem, we propose a novel confidence-aware knowledge\nrepresentation learning framework (CKRL), which detects possible noises in KGs\nwhile learning knowledge representations with confidence simultaneously.\nSpecifically, we introduce the triple confidence to conventional\ntranslation-based methods for knowledge representation learning. To make triple\nconfidence more flexible and universal, we only utilize the internal structural\ninformation in KGs, and propose three kinds of triple confidences considering\nboth local and global structural information. In experiments, We evaluate our\nmodels on knowledge graph noise detection, knowledge graph completion and\ntriple classification. Experimental results demonstrate that our\nconfidence-aware models achieve significant and consistent improvements on all\ntasks, which confirms the capability of CKRL modeling confidence with\nstructural information in both KG noise detection and knowledge representation\nlearning.","url_abs":"http://arxiv.org/abs/1705.03202v2","url_pdf":"http://arxiv.org/pdf/1705.03202v2.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":"does-william-shakespeare-really-write-hamlet","repo_url":"https://github.com/thunlp/CKRL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"triple-classification","task_name":"Triple Classification"}],"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":"thunlp/CKRL","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":"e67d9b711cdc0ca0ef915794bdbca10c65d2c79540cbc3a5d4f66932f8320a68","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}