{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6V2PJMEVYCL2A3BFI2V4FPSAX7","short_pith_number":"pith:6V2PJMEV","schema_version":"1.0","canonical_sha256":"f574f4b095c097a06c2546abc2be40bfd1dd9622bc7b475cc6df145442e446c6","source":{"kind":"arxiv","id":"1706.07535","version":1},"attestation_state":"computed","paper":{"title":"Efficient Approximate Solutions to Mutual Information Based Global Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binbin Lin, Hemanth Venkateswara, Jieping Ye, Prasanth Lade, Sethuraman Panchanathan","submitted_at":"2017-06-23T01:08:59Z","abstract_excerpt":"Mutual Information (MI) is often used for feature selection when developing classifier models. Estimating the MI for a subset of features is often intractable. We demonstrate, that under the assumptions of conditional independence, MI between a subset of features can be expressed as the Conditional Mutual Information (CMI) between pairs of features. But selecting features with the highest CMI turns out to be a hard combinatorial problem. In this work, we have applied two unique global methods, Truncated Power Method (TPower) and Low Rank Bilinear Approximation (LowRank), to solve the feature s"},"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":"1706.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T01:08:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1efd7b1ba5f99e86ca772f571d8a25521d4e98f58fe0b3bd7e23cf920ef4987f","abstract_canon_sha256":"9a97b69dc867c0e60349e1c58687e75cfa68a3ebdc94496ec42ddd3b728ac017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.842084Z","signature_b64":"laiEUjtWHsFFS/RJ0t7HUWU9L00Ilx4sSS2t5pGR78jwkqRI4mkk7Fs5ZLOLVzJ1zxy/HQgQFQmmZdGkeE7YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f574f4b095c097a06c2546abc2be40bfd1dd9622bc7b475cc6df145442e446c6","last_reissued_at":"2026-05-18T00:41:48.841506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.841506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Approximate Solutions to Mutual Information Based Global Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binbin Lin, Hemanth Venkateswara, Jieping Ye, Prasanth Lade, Sethuraman Panchanathan","submitted_at":"2017-06-23T01:08:59Z","abstract_excerpt":"Mutual Information (MI) is often used for feature selection when developing classifier models. Estimating the MI for a subset of features is often intractable. We demonstrate, that under the assumptions of conditional independence, MI between a subset of features can be expressed as the Conditional Mutual Information (CMI) between pairs of features. But selecting features with the highest CMI turns out to be a hard combinatorial problem. In this work, we have applied two unique global methods, Truncated Power Method (TPower) and Low Rank Bilinear Approximation (LowRank), to solve the feature s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07535","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":"1706.07535","created_at":"2026-05-18T00:41:48.841592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07535v1","created_at":"2026-05-18T00:41:48.841592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07535","created_at":"2026-05-18T00:41:48.841592+00:00"},{"alias_kind":"pith_short_12","alias_value":"6V2PJMEVYCL2","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6V2PJMEVYCL2A3BF","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6V2PJMEV","created_at":"2026-05-18T12:31:03.183658+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/6V2PJMEVYCL2A3BFI2V4FPSAX7","json":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7.json","graph_json":"https://pith.science/api/pith-number/6V2PJMEVYCL2A3BFI2V4FPSAX7/graph.json","events_json":"https://pith.science/api/pith-number/6V2PJMEVYCL2A3BFI2V4FPSAX7/events.json","paper":"https://pith.science/paper/6V2PJMEV"},"agent_actions":{"view_html":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7","download_json":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7.json","view_paper":"https://pith.science/paper/6V2PJMEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/6V2PJMEVYCL2A3BFI2V4FPSAX7/graph.json","fetch_events":"https://pith.science/api/pith-number/6V2PJMEVYCL2A3BFI2V4FPSAX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7/action/storage_attestation","attest_author":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7/action/author_attestation","sign_citation":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7/action/citation_signature","submit_replication":"https://pith.science/pith/6V2PJMEVYCL2A3BFI2V4FPSAX7/action/replication_record"}},"created_at":"2026-05-18T00:41:48.841592+00:00","updated_at":"2026-05-18T00:41:48.841592+00:00"}