{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XIBZ6TCYG2XUQSXDPGGYMCNDLV","short_pith_number":"pith:XIBZ6TCY","schema_version":"1.0","canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","source":{"kind":"arxiv","id":"1202.3725","version":1},"attestation_state":"computed","paper":{"title":"Generalized Fisher Score for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiawei Han, Quanquan Gu, Zhenhui Li","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims at finding an subset of features, which maximize the lower bound of traditional Fisher score. The resulting feature selection problem is a mixed integer programming, which can be reformulated as a quadratically constrained linear programming (QCLP). It is solved by cutting plane "},"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":"1202.3725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"188125ecb95d0195ce7490da7fc2891b4c8a9961b7a92346c08ec5f19cd27860","abstract_canon_sha256":"76c0dba5227717d0b4d12b5a177b907283fb47f4e730a0268b3f25c67c7878e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.303997Z","signature_b64":"k9XvNsXJe+8DL2sBJ1MmG7C17LcEjBGdYjASos+PoZO+qGpXnSJJruFz1uBRCAnYz7/GOIFeGrFuZIGdBptyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba039f4c5836af484ae3798d8609a35d7308c766589d1c9678eaabf22e97f53f","last_reissued_at":"2026-05-18T04:02:03.303342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.303342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Fisher Score for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiawei Han, Quanquan Gu, Zhenhui Li","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims at finding an subset of features, which maximize the lower bound of traditional Fisher score. The resulting feature selection problem is a mixed integer programming, which can be reformulated as a quadratically constrained linear programming (QCLP). It is solved by cutting plane "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3725","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":"1202.3725","created_at":"2026-05-18T04:02:03.303442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3725v1","created_at":"2026-05-18T04:02:03.303442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3725","created_at":"2026-05-18T04:02:03.303442+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIBZ6TCYG2XU","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIBZ6TCYG2XUQSXD","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIBZ6TCY","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.31588","citing_title":"Power law scaling for classification accuracy in physical neural networks","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV","json":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV.json","graph_json":"https://pith.science/api/pith-number/XIBZ6TCYG2XUQSXDPGGYMCNDLV/graph.json","events_json":"https://pith.science/api/pith-number/XIBZ6TCYG2XUQSXDPGGYMCNDLV/events.json","paper":"https://pith.science/paper/XIBZ6TCY"},"agent_actions":{"view_html":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV","download_json":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV.json","view_paper":"https://pith.science/paper/XIBZ6TCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3725&json=true","fetch_graph":"https://pith.science/api/pith-number/XIBZ6TCYG2XUQSXDPGGYMCNDLV/graph.json","fetch_events":"https://pith.science/api/pith-number/XIBZ6TCYG2XUQSXDPGGYMCNDLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/action/storage_attestation","attest_author":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/action/author_attestation","sign_citation":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/action/citation_signature","submit_replication":"https://pith.science/pith/XIBZ6TCYG2XUQSXDPGGYMCNDLV/action/replication_record"}},"created_at":"2026-05-18T04:02:03.303442+00:00","updated_at":"2026-05-18T04:02:03.303442+00:00"}