{"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/a-shared-latent-space-matrix-factorisation","title":"A shared latent space matrix factorisation method for recommending new trial evidence for systematic review updates","arxiv_id":"1709.06758","date":"2018-02-27","proceeding":null,"authors":["Surian Didi","Dunn Adam G.","Orenstein Liat","Bashir Rabia","Coiera Enrico","Bourgeois Florence T."],"abstract":"Clinical trial registries can be used to monitor the production of trial\nevidence and signal when systematic reviews become out of date. However, this\nuse has been limited to date due to the extensive manual review required to\nsearch for and screen relevant trial registrations. Our aim was to evaluate a\nnew method that could partially automate the identification of trial\nregistrations that may be relevant for systematic review updates. We identified\n179 systematic reviews of drug interventions for type 2 diabetes, which\nincluded 537 clinical trials that had registrations in ClinicalTrials.gov. We\ntested a matrix factorisation approach that uses a shared latent space to learn\nhow to rank relevant trial registrations for each systematic review, comparing\nthe performance to document similarity to rank relevant trial registrations.\nThe two approaches were tested on a holdout set of the newest trials from the\nset of type 2 diabetes systematic reviews and an unseen set of 141 clinical\ntrial registrations from 17 updated systematic reviews published in the\nCochrane Database of Systematic Reviews. The matrix factorisation approach\noutperformed the document similarity approach with a median rank of 59 and\nrecall@100 of 60.9%, compared to a median rank of 138 and recall@100 of 42.8%\nin the document similarity baseline. In the second set of systematic reviews\nand their updates, the highest performing approach used document similarity and\ngave a median rank of 67 (recall@100 of 62.9%). The proposed method was useful\nfor ranking trial registrations to reduce the manual workload associated with\nfinding relevant trials for systematic review updates. The results suggest that\nthe approach could be used as part of a semi-automated pipeline for monitoring\npotentially new evidence for inclusion in a review update.","url_abs":"http://arxiv.org/abs/1709.06758v4","url_pdf":"http://arxiv.org/pdf/1709.06758v4.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":"a-shared-latent-space-matrix-factorisation","repo_url":"https://github.com/dsurian/matfac","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"holdout-set","task_name":"Holdout Set"}],"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":"dsurian/matfac","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":"461a1c7d113af0444d292453067c71af0fc0a017697d18f687a94839143e286e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}