{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5IOFYCCLMOE542V4HTACQMEEJL","short_pith_number":"pith:5IOFYCCL","schema_version":"1.0","canonical_sha256":"ea1c5c084b6389de6abc3cc02830844ad9dfdc0ae2e3e732282a784278b43840","source":{"kind":"arxiv","id":"1306.0237","version":3},"attestation_state":"computed","paper":{"title":"Guided Random Forest in the RRF Package","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Houtao Deng","submitted_at":"2013-06-02T18:30:45Z","abstract_excerpt":"Random Forest (RF) is a powerful supervised learner and has been popularly used in many applications such as bioinformatics.\n  In this work we propose the guided random forest (GRF) for feature selection. Similar to a feature selection method called guided regularized random forest (GRRF), GRF is built using the importance scores from an ordinary RF. However, the trees in GRRF are built sequentially, are highly correlated and do not allow for parallel computing, while the trees in GRF are built independently and can be implemented in parallel. Experiments on 10 high-dimensional gene data sets "},"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":"1306.0237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-02T18:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"0331abae3c1e7016a91871517e33562d90071c725aabbc30a47492d6958deec1","abstract_canon_sha256":"2c67181bab7f58d99c7d6750b7db9ed3d8460561dd96220f5284ff193af8f8a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:54.974833Z","signature_b64":"kCj7A6iC9NQ66rVWDVL3e5cYCDxl4s0nRt0dsfez1MVLwsY4zFx8RSkHXX3YRtrO1+NqHdK4Rl8OlineIZAVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1c5c084b6389de6abc3cc02830844ad9dfdc0ae2e3e732282a784278b43840","last_reissued_at":"2026-05-18T03:06:54.973589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:54.973589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guided Random Forest in the RRF Package","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Houtao Deng","submitted_at":"2013-06-02T18:30:45Z","abstract_excerpt":"Random Forest (RF) is a powerful supervised learner and has been popularly used in many applications such as bioinformatics.\n  In this work we propose the guided random forest (GRF) for feature selection. Similar to a feature selection method called guided regularized random forest (GRRF), GRF is built using the importance scores from an ordinary RF. However, the trees in GRRF are built sequentially, are highly correlated and do not allow for parallel computing, while the trees in GRF are built independently and can be implemented in parallel. Experiments on 10 high-dimensional gene data sets "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0237","kind":"arxiv","version":3},"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":"1306.0237","created_at":"2026-05-18T03:06:54.973704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0237v3","created_at":"2026-05-18T03:06:54.973704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0237","created_at":"2026-05-18T03:06:54.973704+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IOFYCCLMOE5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IOFYCCLMOE542V4","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IOFYCCL","created_at":"2026-05-18T12:27:34.582898+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/5IOFYCCLMOE542V4HTACQMEEJL","json":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL.json","graph_json":"https://pith.science/api/pith-number/5IOFYCCLMOE542V4HTACQMEEJL/graph.json","events_json":"https://pith.science/api/pith-number/5IOFYCCLMOE542V4HTACQMEEJL/events.json","paper":"https://pith.science/paper/5IOFYCCL"},"agent_actions":{"view_html":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL","download_json":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL.json","view_paper":"https://pith.science/paper/5IOFYCCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0237&json=true","fetch_graph":"https://pith.science/api/pith-number/5IOFYCCLMOE542V4HTACQMEEJL/graph.json","fetch_events":"https://pith.science/api/pith-number/5IOFYCCLMOE542V4HTACQMEEJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL/action/storage_attestation","attest_author":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL/action/author_attestation","sign_citation":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL/action/citation_signature","submit_replication":"https://pith.science/pith/5IOFYCCLMOE542V4HTACQMEEJL/action/replication_record"}},"created_at":"2026-05-18T03:06:54.973704+00:00","updated_at":"2026-05-18T03:06:54.973704+00:00"}