{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LW54RDWQE2NK5MKBKAAAVNZP4U","short_pith_number":"pith:LW54RDWQ","schema_version":"1.0","canonical_sha256":"5dbbc88ed0269aaeb14150000ab72fe50c4508df525e6dc863d56ca4e6c46b70","source":{"kind":"arxiv","id":"1501.07584","version":1},"attestation_state":"computed","paper":{"title":"Efficient Divide-And-Conquer Classification Based on Feature-Space Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo-Wei Chen, Feng Jiang, Qi Guo, Sun-Yuan Kung, Xiangyang Ji","submitted_at":"2015-01-29T20:41:29Z","abstract_excerpt":"This study presents a divide-and-conquer (DC) approach based on feature space decomposition for classification. When large-scale datasets are present, typical approaches usually employed truncated kernel methods on the feature space or DC approaches on the sample space. However, this did not guarantee separability between classes, owing to overfitting. To overcome such problems, this work proposes a novel DC approach on feature spaces consisting of three steps. Firstly, we divide the feature space into several subspaces using the decomposition method proposed in this paper. Subsequently, these"},"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":"1501.07584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-29T20:41:29Z","cross_cats_sorted":[],"title_canon_sha256":"b2dab4c0024bdd315140fbd0d8e234d9bc6f955b1c9758671ba7141e032c70bd","abstract_canon_sha256":"40b8f73e1efe9c3783b97b1e380434ed0fe09cf9b51490aaad693cac2728dc82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.575668Z","signature_b64":"OHQU/2gQpAgpq8Tuw6fCXLO15paG6L5hubkmN1WotQ70cptuaEuUQRnjGWxdGq+UmlEEyEeMGwuUo5+Gp7MOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dbbc88ed0269aaeb14150000ab72fe50c4508df525e6dc863d56ca4e6c46b70","last_reissued_at":"2026-05-18T00:09:42.575031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.575031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Divide-And-Conquer Classification Based on Feature-Space Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo-Wei Chen, Feng Jiang, Qi Guo, Sun-Yuan Kung, Xiangyang Ji","submitted_at":"2015-01-29T20:41:29Z","abstract_excerpt":"This study presents a divide-and-conquer (DC) approach based on feature space decomposition for classification. When large-scale datasets are present, typical approaches usually employed truncated kernel methods on the feature space or DC approaches on the sample space. However, this did not guarantee separability between classes, owing to overfitting. To overcome such problems, this work proposes a novel DC approach on feature spaces consisting of three steps. Firstly, we divide the feature space into several subspaces using the decomposition method proposed in this paper. Subsequently, these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07584","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":"1501.07584","created_at":"2026-05-18T00:09:42.575137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07584v1","created_at":"2026-05-18T00:09:42.575137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07584","created_at":"2026-05-18T00:09:42.575137+00:00"},{"alias_kind":"pith_short_12","alias_value":"LW54RDWQE2NK","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LW54RDWQE2NK5MKB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LW54RDWQ","created_at":"2026-05-18T12:29:29.992203+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/LW54RDWQE2NK5MKBKAAAVNZP4U","json":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U.json","graph_json":"https://pith.science/api/pith-number/LW54RDWQE2NK5MKBKAAAVNZP4U/graph.json","events_json":"https://pith.science/api/pith-number/LW54RDWQE2NK5MKBKAAAVNZP4U/events.json","paper":"https://pith.science/paper/LW54RDWQ"},"agent_actions":{"view_html":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U","download_json":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U.json","view_paper":"https://pith.science/paper/LW54RDWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07584&json=true","fetch_graph":"https://pith.science/api/pith-number/LW54RDWQE2NK5MKBKAAAVNZP4U/graph.json","fetch_events":"https://pith.science/api/pith-number/LW54RDWQE2NK5MKBKAAAVNZP4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U/action/storage_attestation","attest_author":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U/action/author_attestation","sign_citation":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U/action/citation_signature","submit_replication":"https://pith.science/pith/LW54RDWQE2NK5MKBKAAAVNZP4U/action/replication_record"}},"created_at":"2026-05-18T00:09:42.575137+00:00","updated_at":"2026-05-18T00:09:42.575137+00:00"}