{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KL66GKNCZ3E3NQ34O6DR5KDQ5R","short_pith_number":"pith:KL66GKNC","schema_version":"1.0","canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","source":{"kind":"arxiv","id":"1903.10039","version":1},"attestation_state":"computed","paper":{"title":"A Strongly Consistent Sparse $k$-means Clustering with Direct $l_1$ Penalization on Variable Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Saptarshi Chakraborty, Swagatam Das","submitted_at":"2019-03-24T18:45:35Z","abstract_excerpt":"We propose the Lasso Weighted $k$-means ($LW$-$k$-means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features ($p$) can be much larger compared to the number of observations ($n$). In the $LW$-$k$-means algorithm, we introduce a lasso-based penalty term, directly on the feature weights to incorporate feature selection in the framework of sparse clustering. $LW$-$k$-means does not make any distributional assumption of the given dataset and thus, induces a non-parametric method for feature selection. We also analytically investiga"},"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":"1903.10039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-24T18:45:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"44c48b5e7d755df2be734f06fdc38ceb3224e46eac32499267e0bfd325e3d307","abstract_canon_sha256":"d6db368af45416e35c20e535f86ef10fdb42cb4cb1e9049bd1580abe94b5e779"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:34.688646Z","signature_b64":"cYwekjHFqQmAXAU7wBxEdJDIx0sF2EjakN6S/xve/y3xC36XXekta0r1zUqgdogsS0kFjd7QI+eS3gzdm5uFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52fde329a2cec9b6c37c77871ea870ec7b0f81435c4bc4b8c168ebe427384d0f","last_reissued_at":"2026-05-17T23:50:34.688123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:34.688123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Strongly Consistent Sparse $k$-means Clustering with Direct $l_1$ Penalization on Variable Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Saptarshi Chakraborty, Swagatam Das","submitted_at":"2019-03-24T18:45:35Z","abstract_excerpt":"We propose the Lasso Weighted $k$-means ($LW$-$k$-means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features ($p$) can be much larger compared to the number of observations ($n$). In the $LW$-$k$-means algorithm, we introduce a lasso-based penalty term, directly on the feature weights to incorporate feature selection in the framework of sparse clustering. $LW$-$k$-means does not make any distributional assumption of the given dataset and thus, induces a non-parametric method for feature selection. We also analytically investiga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10039","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":"1903.10039","created_at":"2026-05-17T23:50:34.688209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10039v1","created_at":"2026-05-17T23:50:34.688209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10039","created_at":"2026-05-17T23:50:34.688209+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL66GKNCZ3E3","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL66GKNCZ3E3NQ34","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL66GKNC","created_at":"2026-05-18T12:33:21.387695+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/KL66GKNCZ3E3NQ34O6DR5KDQ5R","json":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R.json","graph_json":"https://pith.science/api/pith-number/KL66GKNCZ3E3NQ34O6DR5KDQ5R/graph.json","events_json":"https://pith.science/api/pith-number/KL66GKNCZ3E3NQ34O6DR5KDQ5R/events.json","paper":"https://pith.science/paper/KL66GKNC"},"agent_actions":{"view_html":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R","download_json":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R.json","view_paper":"https://pith.science/paper/KL66GKNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10039&json=true","fetch_graph":"https://pith.science/api/pith-number/KL66GKNCZ3E3NQ34O6DR5KDQ5R/graph.json","fetch_events":"https://pith.science/api/pith-number/KL66GKNCZ3E3NQ34O6DR5KDQ5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/action/storage_attestation","attest_author":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/action/author_attestation","sign_citation":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/action/citation_signature","submit_replication":"https://pith.science/pith/KL66GKNCZ3E3NQ34O6DR5KDQ5R/action/replication_record"}},"created_at":"2026-05-17T23:50:34.688209+00:00","updated_at":"2026-05-17T23:50:34.688209+00:00"}