{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5KKVV4XURVZKSWUVAQ5PCQOZT3","short_pith_number":"pith:5KKVV4XU","schema_version":"1.0","canonical_sha256":"ea955af2f48d72a95a95043af141d99ee2911a831e01af85614f0238acc89970","source":{"kind":"arxiv","id":"1608.07934","version":1},"attestation_state":"computed","paper":{"title":"Relevant based structure learning for feature selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hadi Zare, Mojtaba Niazi","submitted_at":"2016-08-29T07:21:20Z","abstract_excerpt":"Feature selection is an important task in many problems occurring in pattern recognition, bioinformatics, machine learning and data mining applications. The feature selection approach enables us to reduce the computation burden and the falling accuracy effect of dealing with huge number of features in typical learning problems. There is a variety of techniques for feature selection in supervised learning problems based on different selection metrics. In this paper, we propose a novel unified framework for feature selection built on the graphical models and information theoretic tools. The prop"},"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":"1608.07934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-29T07:21:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6066651946e5ef7ac050e2ec27533ff69d6275ab9004df9ecc03a1e98af121d9","abstract_canon_sha256":"2075589f059fd2a8d217382012b934b06973e2d68864c286b20420a251802668"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.556478Z","signature_b64":"X+AFerbGS6xz35enlkJuo01Gf3CkR/3TdfVS2HkzU8EqPwhHwh1KIsaBkmL9UczGwgs632jOQDUg57psU0DlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea955af2f48d72a95a95043af141d99ee2911a831e01af85614f0238acc89970","last_reissued_at":"2026-05-18T01:07:49.555991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.555991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relevant based structure learning for feature selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hadi Zare, Mojtaba Niazi","submitted_at":"2016-08-29T07:21:20Z","abstract_excerpt":"Feature selection is an important task in many problems occurring in pattern recognition, bioinformatics, machine learning and data mining applications. The feature selection approach enables us to reduce the computation burden and the falling accuracy effect of dealing with huge number of features in typical learning problems. There is a variety of techniques for feature selection in supervised learning problems based on different selection metrics. In this paper, we propose a novel unified framework for feature selection built on the graphical models and information theoretic tools. The prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07934","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":"1608.07934","created_at":"2026-05-18T01:07:49.556062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07934v1","created_at":"2026-05-18T01:07:49.556062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07934","created_at":"2026-05-18T01:07:49.556062+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KKVV4XURVZK","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KKVV4XURVZKSWUV","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KKVV4XU","created_at":"2026-05-18T12:30:01.593930+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/5KKVV4XURVZKSWUVAQ5PCQOZT3","json":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3.json","graph_json":"https://pith.science/api/pith-number/5KKVV4XURVZKSWUVAQ5PCQOZT3/graph.json","events_json":"https://pith.science/api/pith-number/5KKVV4XURVZKSWUVAQ5PCQOZT3/events.json","paper":"https://pith.science/paper/5KKVV4XU"},"agent_actions":{"view_html":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3","download_json":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3.json","view_paper":"https://pith.science/paper/5KKVV4XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/5KKVV4XURVZKSWUVAQ5PCQOZT3/graph.json","fetch_events":"https://pith.science/api/pith-number/5KKVV4XURVZKSWUVAQ5PCQOZT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3/action/storage_attestation","attest_author":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3/action/author_attestation","sign_citation":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3/action/citation_signature","submit_replication":"https://pith.science/pith/5KKVV4XURVZKSWUVAQ5PCQOZT3/action/replication_record"}},"created_at":"2026-05-18T01:07:49.556062+00:00","updated_at":"2026-05-18T01:07:49.556062+00:00"}