{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DKIPLQNYCFUXDFMYP34BRPBVLP","short_pith_number":"pith:DKIPLQNY","schema_version":"1.0","canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","source":{"kind":"arxiv","id":"1612.00554","version":1},"attestation_state":"computed","paper":{"title":"Higher Order Mutual Information Approximation for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandrajit Bajaj, Jilin Wu, Soumyajit Gupta","submitted_at":"2016-12-02T03:34:44Z","abstract_excerpt":"Feature selection is a process of choosing a subset of relevant features so that the quality of prediction models can be improved. An extensive body of work exists on information-theoretic feature selection, based on maximizing Mutual Information (MI) between subsets of features and class labels. The prior methods use a lower order approximation, by treating the joint entropy as a summation of several single variable entropies. This leads to locally optimal selections and misses multi-way feature combinations. We present a higher order MI based approximation technique called Higher Order Featu"},"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":"1612.00554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T03:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"f338642bb686e31f9e817bc407a43452bf1e0268271a13babcedb17302cd4234","abstract_canon_sha256":"8a314dfc942f4522c1df5c6d4a91a0c2d90aa218a6dc1d8b6eeec931b53a0b84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:59.709650Z","signature_b64":"drdF1HDU4PcLGXb1+KiM7aSg5j7m5hBZecOe97112M6sTZw6Ncnau743WdEWLtnL79GB0ErNsqMyrepRYx+lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a90f5c1b811697195987ef818bc355be3c44f15c129b9c48d01291e8c1d7e2b","last_reissued_at":"2026-05-18T00:55:59.709038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:59.709038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher Order Mutual Information Approximation for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandrajit Bajaj, Jilin Wu, Soumyajit Gupta","submitted_at":"2016-12-02T03:34:44Z","abstract_excerpt":"Feature selection is a process of choosing a subset of relevant features so that the quality of prediction models can be improved. An extensive body of work exists on information-theoretic feature selection, based on maximizing Mutual Information (MI) between subsets of features and class labels. The prior methods use a lower order approximation, by treating the joint entropy as a summation of several single variable entropies. This leads to locally optimal selections and misses multi-way feature combinations. We present a higher order MI based approximation technique called Higher Order Featu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00554","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":"1612.00554","created_at":"2026-05-18T00:55:59.709119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00554v1","created_at":"2026-05-18T00:55:59.709119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00554","created_at":"2026-05-18T00:55:59.709119+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKIPLQNYCFUX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKIPLQNYCFUXDFMY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKIPLQNY","created_at":"2026-05-18T12:30:12.583610+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/DKIPLQNYCFUXDFMYP34BRPBVLP","json":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP.json","graph_json":"https://pith.science/api/pith-number/DKIPLQNYCFUXDFMYP34BRPBVLP/graph.json","events_json":"https://pith.science/api/pith-number/DKIPLQNYCFUXDFMYP34BRPBVLP/events.json","paper":"https://pith.science/paper/DKIPLQNY"},"agent_actions":{"view_html":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP","download_json":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP.json","view_paper":"https://pith.science/paper/DKIPLQNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00554&json=true","fetch_graph":"https://pith.science/api/pith-number/DKIPLQNYCFUXDFMYP34BRPBVLP/graph.json","fetch_events":"https://pith.science/api/pith-number/DKIPLQNYCFUXDFMYP34BRPBVLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/action/storage_attestation","attest_author":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/action/author_attestation","sign_citation":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/action/citation_signature","submit_replication":"https://pith.science/pith/DKIPLQNYCFUXDFMYP34BRPBVLP/action/replication_record"}},"created_at":"2026-05-18T00:55:59.709119+00:00","updated_at":"2026-05-18T00:55:59.709119+00:00"}