{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MHUM6ZGHZ2HKD74FEBA275LR4D","short_pith_number":"pith:MHUM6ZGH","schema_version":"1.0","canonical_sha256":"61e8cf64c7ce8ea1ff852041aff571e0ce2b11ebe33fd69dafaf3691b7502ca9","source":{"kind":"arxiv","id":"1804.10742","version":1},"attestation_state":"computed","paper":{"title":"Novel Prediction Techniques Based on Clusterwise Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Artur Dubrawski, Eric Lei, Igor Gitman, Jieshi Chen","submitted_at":"2018-04-28T05:07:42Z","abstract_excerpt":"In this paper we explore different regression models based on Clusterwise Linear Regression (CLR). CLR aims to find the partition of the data into $k$ clusters, such that linear regressions fitted to each of the clusters minimize overall mean squared error on the whole data. The main obstacle preventing to use found regression models for prediction on the unseen test points is the absence of a reasonable way to obtain CLR cluster labels when the values of target variable are unknown. In this paper we propose two novel approaches on how to solve this problem. The first approach, predictive CLR "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.10742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-28T05:07:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3c354ef548413f8a55afda7f085b722a3c9f783b32c40a56deef3ec20a6f26c3","abstract_canon_sha256":"ecfe2016ba4020566cd96e53d2d7dd2614e52d10b95355f2fc2855eacac0885f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.692088Z","signature_b64":"jtPzbn/dQ9WIFNRBUekJ8tDMeVIeHQBxzFqcyPK5pEqxmyTAaxLfsvLTfgPpmWN5Huv4Ubzgxf4gwK42GJhUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61e8cf64c7ce8ea1ff852041aff571e0ce2b11ebe33fd69dafaf3691b7502ca9","last_reissued_at":"2026-05-18T00:17:15.691549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.691549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Novel Prediction Techniques Based on Clusterwise Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Artur Dubrawski, Eric Lei, Igor Gitman, Jieshi Chen","submitted_at":"2018-04-28T05:07:42Z","abstract_excerpt":"In this paper we explore different regression models based on Clusterwise Linear Regression (CLR). CLR aims to find the partition of the data into $k$ clusters, such that linear regressions fitted to each of the clusters minimize overall mean squared error on the whole data. The main obstacle preventing to use found regression models for prediction on the unseen test points is the absence of a reasonable way to obtain CLR cluster labels when the values of target variable are unknown. In this paper we propose two novel approaches on how to solve this problem. The first approach, predictive CLR "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10742","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.10742","created_at":"2026-05-18T00:17:15.691603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10742v1","created_at":"2026-05-18T00:17:15.691603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10742","created_at":"2026-05-18T00:17:15.691603+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHUM6ZGHZ2HK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHUM6ZGHZ2HKD74F","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHUM6ZGH","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D","json":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D.json","graph_json":"https://pith.science/api/pith-number/MHUM6ZGHZ2HKD74FEBA275LR4D/graph.json","events_json":"https://pith.science/api/pith-number/MHUM6ZGHZ2HKD74FEBA275LR4D/events.json","paper":"https://pith.science/paper/MHUM6ZGH"},"agent_actions":{"view_html":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D","download_json":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D.json","view_paper":"https://pith.science/paper/MHUM6ZGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10742&json=true","fetch_graph":"https://pith.science/api/pith-number/MHUM6ZGHZ2HKD74FEBA275LR4D/graph.json","fetch_events":"https://pith.science/api/pith-number/MHUM6ZGHZ2HKD74FEBA275LR4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D/action/storage_attestation","attest_author":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D/action/author_attestation","sign_citation":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D/action/citation_signature","submit_replication":"https://pith.science/pith/MHUM6ZGHZ2HKD74FEBA275LR4D/action/replication_record"}},"created_at":"2026-05-18T00:17:15.691603+00:00","updated_at":"2026-05-18T00:17:15.691603+00:00"}