{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P3LTHKXD6DML2PD7XB2V2JEJI4","short_pith_number":"pith:P3LTHKXD","schema_version":"1.0","canonical_sha256":"7ed733aae3f0d8bd3c7fb8755d24894733b5502bc448057b01c80f3b263f7170","source":{"kind":"arxiv","id":"1606.05390","version":1},"attestation_state":"computed","paper":{"title":"Making Tree Ensembles Interpretable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Kohei Hayashi, Satoshi Hara","submitted_at":"2016-06-17T00:33:03Z","abstract_excerpt":"Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model interpretability of tree ensembles. After learning a complex tree ensembles in a standard way, we approximate it by a simpler model that is interpretable for human. To obtain the simpler model, we derive the EM algorithm minimizing the KL divergence from the complex ensemble. A synthetic experiment showed that a complicated tree ensemble was approximated reaso"},"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":"1606.05390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-17T00:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"a5bb975d8e152c86a63d0434d339e2f0241371a8a0c96f2e68d1ba520de1d369","abstract_canon_sha256":"c6a6011873af3867335d8492199452a2c681fdde6e2c9d11f9bc577b01cf19a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:20.237581Z","signature_b64":"Av6B0XedTvQoyyue7rr7QxuXIX9v2n22qYa4yKPdEPka1Zsa1OjOFgl/SKhzVC2gycIST2in08EEBjoTrbDHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed733aae3f0d8bd3c7fb8755d24894733b5502bc448057b01c80f3b263f7170","last_reissued_at":"2026-05-18T01:12:20.237237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:20.237237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making Tree Ensembles Interpretable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Kohei Hayashi, Satoshi Hara","submitted_at":"2016-06-17T00:33:03Z","abstract_excerpt":"Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model interpretability of tree ensembles. After learning a complex tree ensembles in a standard way, we approximate it by a simpler model that is interpretable for human. To obtain the simpler model, we derive the EM algorithm minimizing the KL divergence from the complex ensemble. A synthetic experiment showed that a complicated tree ensemble was approximated reaso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05390","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":"1606.05390","created_at":"2026-05-18T01:12:20.237290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05390v1","created_at":"2026-05-18T01:12:20.237290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05390","created_at":"2026-05-18T01:12:20.237290+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3LTHKXD6DML","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3LTHKXD6DML2PD7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3LTHKXD","created_at":"2026-05-18T12:30:36.002864+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/P3LTHKXD6DML2PD7XB2V2JEJI4","json":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4.json","graph_json":"https://pith.science/api/pith-number/P3LTHKXD6DML2PD7XB2V2JEJI4/graph.json","events_json":"https://pith.science/api/pith-number/P3LTHKXD6DML2PD7XB2V2JEJI4/events.json","paper":"https://pith.science/paper/P3LTHKXD"},"agent_actions":{"view_html":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4","download_json":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4.json","view_paper":"https://pith.science/paper/P3LTHKXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05390&json=true","fetch_graph":"https://pith.science/api/pith-number/P3LTHKXD6DML2PD7XB2V2JEJI4/graph.json","fetch_events":"https://pith.science/api/pith-number/P3LTHKXD6DML2PD7XB2V2JEJI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4/action/storage_attestation","attest_author":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4/action/author_attestation","sign_citation":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4/action/citation_signature","submit_replication":"https://pith.science/pith/P3LTHKXD6DML2PD7XB2V2JEJI4/action/replication_record"}},"created_at":"2026-05-18T01:12:20.237290+00:00","updated_at":"2026-05-18T01:12:20.237290+00:00"}