{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AJIQLYL2TY66KNHXUQB42N7P6U","short_pith_number":"pith:AJIQLYL2","schema_version":"1.0","canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","source":{"kind":"arxiv","id":"1402.0570","version":1},"attestation_state":"computed","paper":{"title":"A Feature Subset Selection Algorithm Automatic Recommendation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Baowen Xu, Guangtao Wang, Heli Sun, Qinbao Song, Xueying Zhang, Yuming Zhou","submitted_at":"2014-02-04T01:37:24Z","abstract_excerpt":"Many feature subset selection (FSS) algorithms have been proposed, but not all of them are appropriate for a given feature selection problem. At the same time, so far there is rarely a good way to choose appropriate FSS algorithms for the problem at hand. Thus, FSS algorithm automatic recommendation is very important and practically useful. In this paper, a meta learning based FSS algorithm automatic recommendation method is presented. The proposed method first identifies the data sets that are most similar to the one at hand by the k-nearest neighbor classification algorithm, and the distance"},"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":"1402.0570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T01:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"c7b82277766ef0ec9ba4c796501c321973fb177b8602972dfdef06d21a0381e3","abstract_canon_sha256":"eedead4337bc81b4c26670f5d16996d1b6000311959ff358da1ac5af03b961ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.842839Z","signature_b64":"K6O20/JaXZ4goKqOk9kfG0Zr2hXtdb/CAFeqZPg9a39akqkdrDT5vdqYtFh4xqbt6pVUEBRxIxkyHCyZNonIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025105e17a9e3de534f7a403cd37eff53d8f5195f5dc731eb9c087ca1cc8d671","last_reissued_at":"2026-05-18T03:00:13.842000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.842000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feature Subset Selection Algorithm Automatic Recommendation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Baowen Xu, Guangtao Wang, Heli Sun, Qinbao Song, Xueying Zhang, Yuming Zhou","submitted_at":"2014-02-04T01:37:24Z","abstract_excerpt":"Many feature subset selection (FSS) algorithms have been proposed, but not all of them are appropriate for a given feature selection problem. At the same time, so far there is rarely a good way to choose appropriate FSS algorithms for the problem at hand. Thus, FSS algorithm automatic recommendation is very important and practically useful. In this paper, a meta learning based FSS algorithm automatic recommendation method is presented. The proposed method first identifies the data sets that are most similar to the one at hand by the k-nearest neighbor classification algorithm, and the distance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0570","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":"1402.0570","created_at":"2026-05-18T03:00:13.842155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0570v1","created_at":"2026-05-18T03:00:13.842155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0570","created_at":"2026-05-18T03:00:13.842155+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJIQLYL2TY66","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJIQLYL2TY66KNHX","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJIQLYL2","created_at":"2026-05-18T12:28:19.803747+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/AJIQLYL2TY66KNHXUQB42N7P6U","json":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U.json","graph_json":"https://pith.science/api/pith-number/AJIQLYL2TY66KNHXUQB42N7P6U/graph.json","events_json":"https://pith.science/api/pith-number/AJIQLYL2TY66KNHXUQB42N7P6U/events.json","paper":"https://pith.science/paper/AJIQLYL2"},"agent_actions":{"view_html":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U","download_json":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U.json","view_paper":"https://pith.science/paper/AJIQLYL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0570&json=true","fetch_graph":"https://pith.science/api/pith-number/AJIQLYL2TY66KNHXUQB42N7P6U/graph.json","fetch_events":"https://pith.science/api/pith-number/AJIQLYL2TY66KNHXUQB42N7P6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/action/storage_attestation","attest_author":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/action/author_attestation","sign_citation":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/action/citation_signature","submit_replication":"https://pith.science/pith/AJIQLYL2TY66KNHXUQB42N7P6U/action/replication_record"}},"created_at":"2026-05-18T03:00:13.842155+00:00","updated_at":"2026-05-18T03:00:13.842155+00:00"}