{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VT3J7H3A4BRJFO37BNFENQFWOI","short_pith_number":"pith:VT3J7H3A","schema_version":"1.0","canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","source":{"kind":"arxiv","id":"1905.11226","version":2},"attestation_state":"computed","paper":{"title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farhad Shakerin, Gopal Gupta","submitted_at":"2019-05-24T06:05:10Z","abstract_excerpt":"We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and utilities respectively. We make use of TreeExplainer, a fast and scalable implementation of the Explainable AI tool SHAP, to extract locally important features and their weights from ensemble tree models. Our experiments with UCI standard benchmarks suggest a significant improvement "},"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":"1905.11226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","cross_cats_sorted":["cs.LO","stat.ML"],"title_canon_sha256":"4dec41d672622252a188742319031e6c461c5a4aa14c64475ed48da8dbaf1ccd","abstract_canon_sha256":"e58acc2781552cea4aabb86c082e85292d7fef875bac7dcfb5fb03e9f1a54ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.113699Z","signature_b64":"jRiz16WxdL3/aYQMRjKSjrCWKEvrFqo3sHkYrfi1LHSAdZpuhnW6ef9xGvc/qSwRXyvnQ2Br51bQOJelWZMqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","last_reissued_at":"2026-05-17T23:44:47.113205Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.113205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farhad Shakerin, Gopal Gupta","submitted_at":"2019-05-24T06:05:10Z","abstract_excerpt":"We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and utilities respectively. We make use of TreeExplainer, a fast and scalable implementation of the Explainable AI tool SHAP, to extract locally important features and their weights from ensemble tree models. Our experiments with UCI standard benchmarks suggest a significant improvement "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11226","kind":"arxiv","version":2},"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":"1905.11226","created_at":"2026-05-17T23:44:47.113279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11226v2","created_at":"2026-05-17T23:44:47.113279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11226","created_at":"2026-05-17T23:44:47.113279+00:00"},{"alias_kind":"pith_short_12","alias_value":"VT3J7H3A4BRJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VT3J7H3A4BRJFO37","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VT3J7H3A","created_at":"2026-05-18T12:33:30.264802+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/VT3J7H3A4BRJFO37BNFENQFWOI","json":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI.json","graph_json":"https://pith.science/api/pith-number/VT3J7H3A4BRJFO37BNFENQFWOI/graph.json","events_json":"https://pith.science/api/pith-number/VT3J7H3A4BRJFO37BNFENQFWOI/events.json","paper":"https://pith.science/paper/VT3J7H3A"},"agent_actions":{"view_html":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI","download_json":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI.json","view_paper":"https://pith.science/paper/VT3J7H3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11226&json=true","fetch_graph":"https://pith.science/api/pith-number/VT3J7H3A4BRJFO37BNFENQFWOI/graph.json","fetch_events":"https://pith.science/api/pith-number/VT3J7H3A4BRJFO37BNFENQFWOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/action/storage_attestation","attest_author":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/action/author_attestation","sign_citation":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/action/citation_signature","submit_replication":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/action/replication_record"}},"created_at":"2026-05-17T23:44:47.113279+00:00","updated_at":"2026-05-17T23:44:47.113279+00:00"}