{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MVVLR4XUJHUPNZITBRDQPK7PVL","short_pith_number":"pith:MVVLR4XU","schema_version":"1.0","canonical_sha256":"656ab8f2f449e8f6e5130c4707abefaafcef6e1c78e306689e856e2feb119bb6","source":{"kind":"arxiv","id":"1409.7794","version":3},"attestation_state":"computed","paper":{"title":"Large-scale Online Feature Selection for Ultra-high Dimensional Sparse Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Nenghai Yu, Steven C. H. Hoi, Tao Mei, Yue Wu","submitted_at":"2014-09-27T10:58:09Z","abstract_excerpt":"Feature selection with large-scale high-dimensional data is important yet very challenging in machine learning and data mining. Online feature selection is a promising new paradigm that is more efficient and scalable than batch feature section methods, but the existing online approaches usually fall short in their inferior efficacy as compared with batch approaches. In this paper, we present a novel second-order online feature selection scheme that is simple yet effective, very fast and extremely scalable to deal with large-scale ultra-high dimensional sparse data streams. The basic idea is to"},"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":"1409.7794","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-27T10:58:09Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a749ad770167f7e2138ed8b645c21444e9711efb958b05aa86a6c2a240349192","abstract_canon_sha256":"569e2eac8e4cbc6bd3e6d2bafaaa5ab04138790f9026b90617d4a294d0d5332e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:31.855244Z","signature_b64":"sm6uePrBgRohyrygfWk1sstmdQHFHcureLFnwymCp6x39fxQbJlFlW+uR9rjQkEQv6/HdsLkUjHNlV1AsTwUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656ab8f2f449e8f6e5130c4707abefaafcef6e1c78e306689e856e2feb119bb6","last_reissued_at":"2026-05-18T01:26:31.854659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:31.854659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-scale Online Feature Selection for Ultra-high Dimensional Sparse Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Nenghai Yu, Steven C. H. Hoi, Tao Mei, Yue Wu","submitted_at":"2014-09-27T10:58:09Z","abstract_excerpt":"Feature selection with large-scale high-dimensional data is important yet very challenging in machine learning and data mining. Online feature selection is a promising new paradigm that is more efficient and scalable than batch feature section methods, but the existing online approaches usually fall short in their inferior efficacy as compared with batch approaches. In this paper, we present a novel second-order online feature selection scheme that is simple yet effective, very fast and extremely scalable to deal with large-scale ultra-high dimensional sparse data streams. The basic idea is to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7794","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":"1409.7794","created_at":"2026-05-18T01:26:31.854762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7794v3","created_at":"2026-05-18T01:26:31.854762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7794","created_at":"2026-05-18T01:26:31.854762+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVVLR4XUJHUP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVVLR4XUJHUPNZIT","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVVLR4XU","created_at":"2026-05-18T12:28:38.356838+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/MVVLR4XUJHUPNZITBRDQPK7PVL","json":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL.json","graph_json":"https://pith.science/api/pith-number/MVVLR4XUJHUPNZITBRDQPK7PVL/graph.json","events_json":"https://pith.science/api/pith-number/MVVLR4XUJHUPNZITBRDQPK7PVL/events.json","paper":"https://pith.science/paper/MVVLR4XU"},"agent_actions":{"view_html":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL","download_json":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL.json","view_paper":"https://pith.science/paper/MVVLR4XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7794&json=true","fetch_graph":"https://pith.science/api/pith-number/MVVLR4XUJHUPNZITBRDQPK7PVL/graph.json","fetch_events":"https://pith.science/api/pith-number/MVVLR4XUJHUPNZITBRDQPK7PVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL/action/storage_attestation","attest_author":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL/action/author_attestation","sign_citation":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL/action/citation_signature","submit_replication":"https://pith.science/pith/MVVLR4XUJHUPNZITBRDQPK7PVL/action/replication_record"}},"created_at":"2026-05-18T01:26:31.854762+00:00","updated_at":"2026-05-18T01:26:31.854762+00:00"}