{"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/who-wins-the-miss-contest-for-imputation","title":"Who wins the Miss Contest for Imputation Methods? Our Vote for Miss BooPF","arxiv_id":"1711.11394","date":"2017-11-30","proceeding":null,"authors":["Burim Ramosaj","Markus Pauly"],"abstract":"Missing data is an expected issue when large amounts of data is collected,\nand several imputation techniques have been proposed to tackle this problem.\nBeneath classical approaches such as MICE, the application of Machine Learning\ntechniques is tempting. Here, the recently proposed missForest imputation\nmethod has shown high imputation accuracy under the Missing (Completely) at\nRandom scheme with various missing rates. In its core, it is based on a random\nforest for classification and regression, respectively. In this paper we study\nwhether this approach can even be enhanced by other methods such as the\nstochastic gradient tree boosting method, the C5.0 algorithm or modified random\nforest procedures. In particular, other resampling strategies within the random\nforest protocol are suggested. In an extensive simulation study, we analyze\ntheir performances for continuous, categorical as well as mixed-type data.\nTherein, MissBooPF, a combination of the stochastic gradient tree boosting\nmethod together with the parametrically bootstrapped random forest method,\nappeared to be promising. Finally, an empirical analysis focusing on credit\ninformation and Facebook data is conducted.","url_abs":"http://arxiv.org/abs/1711.11394v1","url_pdf":"http://arxiv.org/pdf/1711.11394v1.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":"who-wins-the-miss-contest-for-imputation","repo_url":"https://github.com/yaroslav-moiseev/evidence-based-possibly-best-practices-in-classical-ML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"imputation","task_name":"Imputation"}],"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":"yaroslav-moiseev/evidence-based-possibly-best-practices-in-classical-ML","kind":"listed","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":"62db7134b656b11beaae412ee793b8fd43282ef36469c3e473682138f8400be3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}