{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G73IJQXRLFNB7YKO6KAWKY7FXR","short_pith_number":"pith:G73IJQXR","schema_version":"1.0","canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","source":{"kind":"arxiv","id":"1808.00068","version":1},"attestation_state":"computed","paper":{"title":"A Fuzzy-Rough based Binary Shuffled Frog Leaping Algorithm for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Wook Ahn, Javad Rahimipour Anaraki, Mahdi Eftekhari, Saeed Samet","submitted_at":"2018-07-31T20:38:19Z","abstract_excerpt":"Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones. This paper presents a new feature selection method that efficiently carries out attribute reduction, thereby selecting the most informative features of a dataset. It consists of two components: 1) a measure for feature subset evaluation, and 2) a search strategy. For the evaluation measure, we have "},"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.00068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-31T20:38:19Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"343a28f89261a4b04fe906c7cff15f325bc9a34e4f333e538e5ac51d883da917","abstract_canon_sha256":"f0135feb28ff19df798e82389e7456872f884afdb9505bca4fd17f54a93129b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.237045Z","signature_b64":"tPdH2lJVGPPCVJoalGzjcIEy7xH65f1FFZifPGbxJulHBca3Iq9Df+MY7/dTNEqz/SpcsONxoDva117NFL0+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f684c2f1595a1fe14ef2816563e5bc76ce58d8fa50f006dced6863270e0dff","last_reissued_at":"2026-05-18T00:00:08.236394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.236394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fuzzy-Rough based Binary Shuffled Frog Leaping Algorithm for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Wook Ahn, Javad Rahimipour Anaraki, Mahdi Eftekhari, Saeed Samet","submitted_at":"2018-07-31T20:38:19Z","abstract_excerpt":"Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones. This paper presents a new feature selection method that efficiently carries out attribute reduction, thereby selecting the most informative features of a dataset. It consists of two components: 1) a measure for feature subset evaluation, and 2) a search strategy. For the evaluation measure, we have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00068","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.00068","created_at":"2026-05-18T00:00:08.236509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00068v1","created_at":"2026-05-18T00:00:08.236509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00068","created_at":"2026-05-18T00:00:08.236509+00:00"},{"alias_kind":"pith_short_12","alias_value":"G73IJQXRLFNB","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G73IJQXRLFNB7YKO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G73IJQXR","created_at":"2026-05-18T12:32:25.280505+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/G73IJQXRLFNB7YKO6KAWKY7FXR","json":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR.json","graph_json":"https://pith.science/api/pith-number/G73IJQXRLFNB7YKO6KAWKY7FXR/graph.json","events_json":"https://pith.science/api/pith-number/G73IJQXRLFNB7YKO6KAWKY7FXR/events.json","paper":"https://pith.science/paper/G73IJQXR"},"agent_actions":{"view_html":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR","download_json":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR.json","view_paper":"https://pith.science/paper/G73IJQXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00068&json=true","fetch_graph":"https://pith.science/api/pith-number/G73IJQXRLFNB7YKO6KAWKY7FXR/graph.json","fetch_events":"https://pith.science/api/pith-number/G73IJQXRLFNB7YKO6KAWKY7FXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/action/storage_attestation","attest_author":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/action/author_attestation","sign_citation":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/action/citation_signature","submit_replication":"https://pith.science/pith/G73IJQXRLFNB7YKO6KAWKY7FXR/action/replication_record"}},"created_at":"2026-05-18T00:00:08.236509+00:00","updated_at":"2026-05-18T00:00:08.236509+00:00"}