{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FFGU3RB4PUUGZR6GK6BK5JVZ4E","short_pith_number":"pith:FFGU3RB4","schema_version":"1.0","canonical_sha256":"294d4dc43c7d286cc7c65782aea6b9e10827f5c7bdb36fccc867bf327c9cee57","source":{"kind":"arxiv","id":"1902.09938","version":1},"attestation_state":"computed","paper":{"title":"A Feature Selection Based on Perturbation Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hamid Usefi, Javad Rahimipour Anaraki","submitted_at":"2019-02-26T14:02:21Z","abstract_excerpt":"Consider a supervised dataset $D=[A\\mid \\textbf{b}]$, where $\\textbf{b}$ is the outcome column, rows of $D$ correspond to observations, and columns of $A$ are the features of the dataset. A central problem in machine learning and pattern recognition is to select the most important features from $D$ to be able to predict the outcome. In this paper, we provide a new feature selection method where we use perturbation theory to detect correlations between features. We solve $AX=\\textbf{b}$ using the method of least squares and singular value decomposition of $A$. In practical applications, such as"},"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":"1902.09938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T14:02:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"092d60393f2a98e0a9c17c3d7b359991d9173760c3ff265f16d20136daee51d6","abstract_canon_sha256":"32c060489e8c12a50ad0e516f2c5685a47ad76aca6989823e91d8509a97a0630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.015853Z","signature_b64":"IxcKFcYQ4qUcnar4Eijhb3/kvUEw0y6/9U8D0JFxiFNDX2QFUT+siKsvfLp9qnEk7yDHBXDbh+JV7jNETnQIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294d4dc43c7d286cc7c65782aea6b9e10827f5c7bdb36fccc867bf327c9cee57","last_reissued_at":"2026-05-17T23:52:35.015501Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.015501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feature Selection Based on Perturbation Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hamid Usefi, Javad Rahimipour Anaraki","submitted_at":"2019-02-26T14:02:21Z","abstract_excerpt":"Consider a supervised dataset $D=[A\\mid \\textbf{b}]$, where $\\textbf{b}$ is the outcome column, rows of $D$ correspond to observations, and columns of $A$ are the features of the dataset. A central problem in machine learning and pattern recognition is to select the most important features from $D$ to be able to predict the outcome. In this paper, we provide a new feature selection method where we use perturbation theory to detect correlations between features. We solve $AX=\\textbf{b}$ using the method of least squares and singular value decomposition of $A$. In practical applications, such as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09938","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":"1902.09938","created_at":"2026-05-17T23:52:35.015555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09938v1","created_at":"2026-05-17T23:52:35.015555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09938","created_at":"2026-05-17T23:52:35.015555+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFGU3RB4PUUG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFGU3RB4PUUGZR6G","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFGU3RB4","created_at":"2026-05-18T12:33:15.570797+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/FFGU3RB4PUUGZR6GK6BK5JVZ4E","json":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E.json","graph_json":"https://pith.science/api/pith-number/FFGU3RB4PUUGZR6GK6BK5JVZ4E/graph.json","events_json":"https://pith.science/api/pith-number/FFGU3RB4PUUGZR6GK6BK5JVZ4E/events.json","paper":"https://pith.science/paper/FFGU3RB4"},"agent_actions":{"view_html":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E","download_json":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E.json","view_paper":"https://pith.science/paper/FFGU3RB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09938&json=true","fetch_graph":"https://pith.science/api/pith-number/FFGU3RB4PUUGZR6GK6BK5JVZ4E/graph.json","fetch_events":"https://pith.science/api/pith-number/FFGU3RB4PUUGZR6GK6BK5JVZ4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E/action/storage_attestation","attest_author":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E/action/author_attestation","sign_citation":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E/action/citation_signature","submit_replication":"https://pith.science/pith/FFGU3RB4PUUGZR6GK6BK5JVZ4E/action/replication_record"}},"created_at":"2026-05-17T23:52:35.015555+00:00","updated_at":"2026-05-17T23:52:35.015555+00:00"}