{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DPY2IXPG6GNVM5JE4RGNBVVONU","short_pith_number":"pith:DPY2IXPG","schema_version":"1.0","canonical_sha256":"1bf1a45de6f19b567524e44cd0d6ae6d17ae661c0d466f979a9de31b8696fbcd","source":{"kind":"arxiv","id":"1608.08761","version":2},"attestation_state":"computed","paper":{"title":"hi-RF: Incremental Learning Random Forest for large-scale multi-class Data Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Changjian Wang, Tingting Xie, Yuxing Peng","submitted_at":"2016-08-31T08:18:48Z","abstract_excerpt":"In recent years, dynamically growing data and incrementally growing number of classes pose new challenges to large-scale data classification research. Most traditional methods struggle to balance the precision and computational burden when data and its number of classes increased. However, some methods are with weak precision, and the others are time-consuming. In this paper, we propose an incremental learning method, namely, heterogeneous incremental Nearest Class Mean Random Forest (hi-RF), to handle this issue. It is a heterogeneous method that either replaces trees or updates trees leaves "},"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.08761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T08:18:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1728238fd9e3be3e72e2f32c9b39e7d99ef2fceb5030bf720749588c23dbdfe1","abstract_canon_sha256":"6e1511623ad931074a8e7bc0591934c496777442a164114df49c814810e3d187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.530294Z","signature_b64":"NijVb0yhIFFyKsRrVN48S+o80TUqUt8piL7Qbi3QY1PfJ2WVHYFDjZ1FXzYiSnUdlMX9asxBr3DG+ezIw05gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf1a45de6f19b567524e44cd0d6ae6d17ae661c0d466f979a9de31b8696fbcd","last_reissued_at":"2026-05-18T01:00:52.529810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.529810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"hi-RF: Incremental Learning Random Forest for large-scale multi-class Data Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Changjian Wang, Tingting Xie, Yuxing Peng","submitted_at":"2016-08-31T08:18:48Z","abstract_excerpt":"In recent years, dynamically growing data and incrementally growing number of classes pose new challenges to large-scale data classification research. Most traditional methods struggle to balance the precision and computational burden when data and its number of classes increased. However, some methods are with weak precision, and the others are time-consuming. In this paper, we propose an incremental learning method, namely, heterogeneous incremental Nearest Class Mean Random Forest (hi-RF), to handle this issue. It is a heterogeneous method that either replaces trees or updates trees leaves "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08761","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":"1608.08761","created_at":"2026-05-18T01:00:52.529890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08761v2","created_at":"2026-05-18T01:00:52.529890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08761","created_at":"2026-05-18T01:00:52.529890+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPY2IXPG6GNV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPY2IXPG6GNVM5JE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPY2IXPG","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/DPY2IXPG6GNVM5JE4RGNBVVONU","json":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU.json","graph_json":"https://pith.science/api/pith-number/DPY2IXPG6GNVM5JE4RGNBVVONU/graph.json","events_json":"https://pith.science/api/pith-number/DPY2IXPG6GNVM5JE4RGNBVVONU/events.json","paper":"https://pith.science/paper/DPY2IXPG"},"agent_actions":{"view_html":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU","download_json":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU.json","view_paper":"https://pith.science/paper/DPY2IXPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08761&json=true","fetch_graph":"https://pith.science/api/pith-number/DPY2IXPG6GNVM5JE4RGNBVVONU/graph.json","fetch_events":"https://pith.science/api/pith-number/DPY2IXPG6GNVM5JE4RGNBVVONU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU/action/storage_attestation","attest_author":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU/action/author_attestation","sign_citation":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU/action/citation_signature","submit_replication":"https://pith.science/pith/DPY2IXPG6GNVM5JE4RGNBVVONU/action/replication_record"}},"created_at":"2026-05-18T01:00:52.529890+00:00","updated_at":"2026-05-18T01:00:52.529890+00:00"}