{"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/predicting-conceptnet-path-quality-using","title":"Predicting ConceptNet Path Quality Using Crowdsourced Assessments of Naturalness","arxiv_id":"1902.07831","date":"2019-02-21","proceeding":null,"authors":["Yilun Zhou","Steven Schockaert","Julie A. Shah"],"abstract":"In many applications, it is important to characterize the way in which two\nconcepts are semantically related. Knowledge graphs such as ConceptNet provide\na rich source of information for such characterizations by encoding relations\nbetween concepts as edges in a graph. When two concepts are not directly\nconnected by an edge, their relationship can still be described in terms of the\npaths that connect them. Unfortunately, many of these paths are uninformative\nand noisy, which means that the success of applications that use such path\nfeatures crucially relies on their ability to select high-quality paths. In\nexisting applications, this path selection process is based on relatively\nsimple heuristics. In this paper we instead propose to learn to predict path\nquality from crowdsourced human assessments. Since we are interested in a\ngeneric task-independent notion of quality, we simply ask human participants to\nrank paths according to their subjective assessment of the paths' naturalness,\nwithout attempting to define naturalness or steering the participants towards\nparticular indicators of quality. We show that a neural network model trained\non these assessments is able to predict human judgments on unseen paths with\nnear optimal performance. Most notably, we find that the resulting path\nselection method is substantially better than the current heuristic approaches\nat identifying meaningful paths.","url_abs":"http://arxiv.org/abs/1902.07831v1","url_pdf":"http://arxiv.org/pdf/1902.07831v1.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":"predicting-conceptnet-path-quality-using","repo_url":"https://github.com/YilunZhou/path-naturalness-prediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.07831","atlas_url":"https://app.syntology.ai/?focus=1902.07831","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.07831"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.07831\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.07831"},"call":"get_concepts_for_paper(arxiv_id=\"1902.07831\")"}],"by_repo":[{"repo":"YilunZhou/path-naturalness-prediction","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":"738d73a2668e795ff4c80477667fb55b5efa9975e98ccc789ff4fa5be99fead2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}