{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PDF7WFU5ZXTCMSVE4UZT7JRSIG","short_pith_number":"pith:PDF7WFU5","schema_version":"1.0","canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","source":{"kind":"arxiv","id":"1411.2331","version":1},"attestation_state":"computed","paper":{"title":"N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Avishek Saha, Dawei Yin, Hua Ouyang, Makoto Yamada, Yi Chang","submitted_at":"2014-11-10T05:43:28Z","abstract_excerpt":"We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way. Specifically, we propose a nonlinear extension of the non-negative least-angle regression (LARS) called N${}^3$LARS, where the similarity between input and output is measured through the normalized version of the Hilbert-Schmidt Independence Criterion (HSIC). An advantage of N${}^3$LARS is that it can easily incorporate with map-reduce frameworks such as Hadoop and Spark. Thus, with the help of distributed computing, a set of features can be efficiently selected from"},"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":"1411.2331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-10T05:43:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"893a9a7311376e339265263b87828ffe93c84a3d348948bdf48097b6c7d50c93","abstract_canon_sha256":"26eadf497c9ffebd9150e43aa0a64dd5a4ff27733cfd7e7734b8495cfea074a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:07.809799Z","signature_b64":"qFmyEIaM8GyKS7iHrDBdMfLgGQMrEPq2PVuGLkMiTVUYQhGR7YoiHL0dIjuKLAE52+6WJIi5lZIFO0kyYusoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78cbfb169dcde6264aa4e5333fa632418853bf7154ce20a01f07dcd36fc93c1e","last_reissued_at":"2026-05-18T02:38:07.809090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:07.809090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Avishek Saha, Dawei Yin, Hua Ouyang, Makoto Yamada, Yi Chang","submitted_at":"2014-11-10T05:43:28Z","abstract_excerpt":"We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way. Specifically, we propose a nonlinear extension of the non-negative least-angle regression (LARS) called N${}^3$LARS, where the similarity between input and output is measured through the normalized version of the Hilbert-Schmidt Independence Criterion (HSIC). An advantage of N${}^3$LARS is that it can easily incorporate with map-reduce frameworks such as Hadoop and Spark. Thus, with the help of distributed computing, a set of features can be efficiently selected from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2331","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":"1411.2331","created_at":"2026-05-18T02:38:07.809179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2331v1","created_at":"2026-05-18T02:38:07.809179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2331","created_at":"2026-05-18T02:38:07.809179+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDF7WFU5ZXTC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDF7WFU5ZXTCMSVE","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDF7WFU5","created_at":"2026-05-18T12:28:43.426989+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/PDF7WFU5ZXTCMSVE4UZT7JRSIG","json":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG.json","graph_json":"https://pith.science/api/pith-number/PDF7WFU5ZXTCMSVE4UZT7JRSIG/graph.json","events_json":"https://pith.science/api/pith-number/PDF7WFU5ZXTCMSVE4UZT7JRSIG/events.json","paper":"https://pith.science/paper/PDF7WFU5"},"agent_actions":{"view_html":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG","download_json":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG.json","view_paper":"https://pith.science/paper/PDF7WFU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2331&json=true","fetch_graph":"https://pith.science/api/pith-number/PDF7WFU5ZXTCMSVE4UZT7JRSIG/graph.json","fetch_events":"https://pith.science/api/pith-number/PDF7WFU5ZXTCMSVE4UZT7JRSIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/action/storage_attestation","attest_author":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/action/author_attestation","sign_citation":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/action/citation_signature","submit_replication":"https://pith.science/pith/PDF7WFU5ZXTCMSVE4UZT7JRSIG/action/replication_record"}},"created_at":"2026-05-18T02:38:07.809179+00:00","updated_at":"2026-05-18T02:38:07.809179+00:00"}