{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E2HUCX34ONTQM6W3C2IHDXTDA6","short_pith_number":"pith:E2HUCX34","schema_version":"1.0","canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","source":{"kind":"arxiv","id":"1808.02435","version":1},"attestation_state":"computed","paper":{"title":"Mixed Integer Linear Programming for Feature Selection in Support Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Antonio M. Rodr\\'iguez-Ch\\'ia, Luisa I. Mart\\'inez-Merino, Martine Labb\\'e","submitted_at":"2018-08-07T15:59:17Z","abstract_excerpt":"This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by including a budget constraint that sets in advance a limit on the number of features to be used in the classification process. We propose both an exact and a heuristic procedure to solve this formulation in an efficient way. Finally, the validation of the model is done by checking it with some well-known data sets and comparing it with classical classification me"},"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":"1808.02435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a382477285107743ba4f64d95234cb8d1fff4765aaa46945ee4432a9e8d0096c","abstract_canon_sha256":"70a02410806a516ac8969a64880a858fd061e112283e50d24c307e10c8a38e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:37.044834Z","signature_b64":"N2v+3umwiQzj7HIuV9Qq95/A1cfvVDwAm/VK/yMh4bSPDAr/sPPDjk15wkiX/vdmRuXYg4LlzUUsxcj04BEUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","last_reissued_at":"2026-05-18T00:08:37.044178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:37.044178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Integer Linear Programming for Feature Selection in Support Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Antonio M. Rodr\\'iguez-Ch\\'ia, Luisa I. Mart\\'inez-Merino, Martine Labb\\'e","submitted_at":"2018-08-07T15:59:17Z","abstract_excerpt":"This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by including a budget constraint that sets in advance a limit on the number of features to be used in the classification process. We propose both an exact and a heuristic procedure to solve this formulation in an efficient way. Finally, the validation of the model is done by checking it with some well-known data sets and comparing it with classical classification me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02435","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":"1808.02435","created_at":"2026-05-18T00:08:37.044284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02435v1","created_at":"2026-05-18T00:08:37.044284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02435","created_at":"2026-05-18T00:08:37.044284+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2HUCX34ONTQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2HUCX34ONTQM6W3","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2HUCX34","created_at":"2026-05-18T12:32:19.392346+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/E2HUCX34ONTQM6W3C2IHDXTDA6","json":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6.json","graph_json":"https://pith.science/api/pith-number/E2HUCX34ONTQM6W3C2IHDXTDA6/graph.json","events_json":"https://pith.science/api/pith-number/E2HUCX34ONTQM6W3C2IHDXTDA6/events.json","paper":"https://pith.science/paper/E2HUCX34"},"agent_actions":{"view_html":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6","download_json":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6.json","view_paper":"https://pith.science/paper/E2HUCX34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02435&json=true","fetch_graph":"https://pith.science/api/pith-number/E2HUCX34ONTQM6W3C2IHDXTDA6/graph.json","fetch_events":"https://pith.science/api/pith-number/E2HUCX34ONTQM6W3C2IHDXTDA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/action/storage_attestation","attest_author":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/action/author_attestation","sign_citation":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/action/citation_signature","submit_replication":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/action/replication_record"}},"created_at":"2026-05-18T00:08:37.044284+00:00","updated_at":"2026-05-18T00:08:37.044284+00:00"}