{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W7FKXVDNPAILVGYGWGIP7NLU75","short_pith_number":"pith:W7FKXVDN","schema_version":"1.0","canonical_sha256":"b7caabd46d7810ba9b06b190ffb574ff4336a07f6c1e6aa9c4b99501d0100e64","source":{"kind":"arxiv","id":"1804.05774","version":1},"attestation_state":"computed","paper":{"title":"BELIEF: A distance-based redundancy-proof feature selection method for Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francisco Herrera, Ning Xiong, Salvador Garc\\'ia, Sergio Ram\\'irez-Gallego","submitted_at":"2018-04-16T16:23:14Z","abstract_excerpt":"With the advent of Big Data era, data reduction methods are highly demanded given its ability to simplify huge data, and ease complex learning processes. Concretely, algorithms that are able to filter relevant dimensions from a set of millions are of huge importance. Although effective, these techniques suffer from the \"scalability\" curse as well.\n  In this work, we propose a distributed feature weighting algorithm, which is able to rank millions of features in parallel using large samples. This method, inspired by the well-known RELIEF algorithm, introduces a novel redundancy elimination meas"},"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":"1804.05774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T16:23:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"097d23b023a11de4df9fcde762b5c5cb5825085b253f18643fcbfaa4697f2834","abstract_canon_sha256":"398890d9614e0d9680c6d9fef2d51a8578c0a63200d025b8e9192044571d79d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.425689Z","signature_b64":"ipqabMkP3wfdl8nQpdDcNoGfKNkgX6I0VDtLisSUDMk0KxUU9/bhevd4+t68MfovgdtSI19zP38mPSbTw8uBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7caabd46d7810ba9b06b190ffb574ff4336a07f6c1e6aa9c4b99501d0100e64","last_reissued_at":"2026-05-18T00:18:27.425221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.425221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BELIEF: A distance-based redundancy-proof feature selection method for Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francisco Herrera, Ning Xiong, Salvador Garc\\'ia, Sergio Ram\\'irez-Gallego","submitted_at":"2018-04-16T16:23:14Z","abstract_excerpt":"With the advent of Big Data era, data reduction methods are highly demanded given its ability to simplify huge data, and ease complex learning processes. Concretely, algorithms that are able to filter relevant dimensions from a set of millions are of huge importance. Although effective, these techniques suffer from the \"scalability\" curse as well.\n  In this work, we propose a distributed feature weighting algorithm, which is able to rank millions of features in parallel using large samples. This method, inspired by the well-known RELIEF algorithm, introduces a novel redundancy elimination meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05774","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":"1804.05774","created_at":"2026-05-18T00:18:27.425295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05774v1","created_at":"2026-05-18T00:18:27.425295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05774","created_at":"2026-05-18T00:18:27.425295+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7FKXVDNPAIL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7FKXVDNPAILVGYG","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7FKXVDN","created_at":"2026-05-18T12:32:59.047623+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/W7FKXVDNPAILVGYGWGIP7NLU75","json":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75.json","graph_json":"https://pith.science/api/pith-number/W7FKXVDNPAILVGYGWGIP7NLU75/graph.json","events_json":"https://pith.science/api/pith-number/W7FKXVDNPAILVGYGWGIP7NLU75/events.json","paper":"https://pith.science/paper/W7FKXVDN"},"agent_actions":{"view_html":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75","download_json":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75.json","view_paper":"https://pith.science/paper/W7FKXVDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05774&json=true","fetch_graph":"https://pith.science/api/pith-number/W7FKXVDNPAILVGYGWGIP7NLU75/graph.json","fetch_events":"https://pith.science/api/pith-number/W7FKXVDNPAILVGYGWGIP7NLU75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75/action/storage_attestation","attest_author":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75/action/author_attestation","sign_citation":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75/action/citation_signature","submit_replication":"https://pith.science/pith/W7FKXVDNPAILVGYGWGIP7NLU75/action/replication_record"}},"created_at":"2026-05-18T00:18:27.425295+00:00","updated_at":"2026-05-18T00:18:27.425295+00:00"}