{"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/novel-prediction-techniques-based-on","title":"Novel Prediction Techniques Based on Clusterwise Linear Regression","arxiv_id":"1804.10742","date":"2018-04-28","proceeding":null,"authors":["Igor Gitman","Jieshi Chen","Eric Lei","Artur Dubrawski"],"abstract":"In this paper we explore different regression models based on Clusterwise\nLinear Regression (CLR). CLR aims to find the partition of the data into $k$\nclusters, such that linear regressions fitted to each of the clusters minimize\noverall mean squared error on the whole data. The main obstacle preventing to\nuse found regression models for prediction on the unseen test points is the\nabsence of a reasonable way to obtain CLR cluster labels when the values of\ntarget variable are unknown. In this paper we propose two novel approaches on\nhow to solve this problem. The first approach, predictive CLR builds a separate\nclassification model to predict test CLR labels. The second approach,\nconstrained CLR utilizes a set of user-specified constraints that enforce\ncertain points to go to the same clusters. Assuming the constraint values are\nknown for the test points, they can be directly used to assign CLR labels. We\nevaluate these two approaches on three UCI ML datasets as well as on a large\ncorpus of health insurance claims. We show that both of the proposed algorithms\nsignificantly improve over the known CLR-based regression methods. Moreover,\npredictive CLR consistently outperforms linear regression and random forest,\nand shows comparable performance to support vector regression on UCI ML\ndatasets. The constrained CLR approach achieves the best performance on the\nhealth insurance dataset, while enjoying only $\\approx 20$ times increased\ncomputational time over linear regression.","url_abs":"http://arxiv.org/abs/1804.10742v1","url_pdf":"http://arxiv.org/pdf/1804.10742v1.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":"novel-prediction-techniques-based-on","repo_url":"https://github.com/Kipok/clr_prediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"linear-regression","method_name":"Linear Regression"}],"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":"Kipok/clr_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":"c465b4b1b14c51b9d9201895dd3d8d1c0ba70f14630f229e69dd64fe644d08c5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}