{"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/metboost-exploratory-regression-analysis-with","title":"metboost: Exploratory regression analysis with hierarchically clustered data","arxiv_id":"1702.03994","date":"2017-02-13","proceeding":null,"authors":["Patrick J. Miller","Daniel B. McArtor","Gitta H. Lubke"],"abstract":"As data collections become larger, exploratory regression analysis becomes\nmore important but more challenging. When observations are hierarchically\nclustered the problem is even more challenging because model selection with\nmixed effect models can produce misleading results when nonlinear effects are\nnot included into the model (Bauer and Cai, 2009). A machine learning method\ncalled boosted decision trees (Friedman, 2001) is a good approach for\nexploratory regression analysis in real data sets because it can detect\npredictors with nonlinear and interaction effects while also accounting for\nmissing data. We propose an extension to boosted decision decision trees called\nmetboost for hierarchically clustered data. It works by constraining the\nstructure of each tree to be the same across groups, but allowing the terminal\nnode means to differ. This allows predictors and split points to lead to\ndifferent predictions within each group, and approximates nonlinear group\nspecific effects. Importantly, metboost remains computationally feasible for\nthousands of observations and hundreds of predictors that may contain missing\nvalues. We apply the method to predict math performance for 15,240 students\nfrom 751 schools in data collected in the Educational Longitudinal Study 2002\n(Ingels et al., 2007), allowing 76 predictors to have unique effects for each\nschool. When comparing results to boosted decision trees, metboost has 15%\nimproved prediction performance. Results of a large simulation study show that\nmetboost has up to 70% improved variable selection performance and up to 30%\nimproved prediction performance compared to boosted decision trees when group\nsizes are small","url_abs":"http://arxiv.org/abs/1702.03994v1","url_pdf":"http://arxiv.org/pdf/1702.03994v1.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":"metboost-exploratory-regression-analysis-with","repo_url":"https://github.com/patr1ckm/mvtboost","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"math","task_name":"Math"},{"task_slug":"missing-values","task_name":"Missing Values"},{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"variable-selection","task_name":"Variable Selection"},{"task_slug":"regression-1","task_name":"regression"}],"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":"patr1ckm/mvtboost","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":"08a9331bd27066efbebe01dcf5d6146f008580bd1e1ad3dfce292f5f04dafaec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}