{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PT2W6PND4R3UA67IE5HDYW2G27","short_pith_number":"pith:PT2W6PND","schema_version":"1.0","canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","source":{"kind":"arxiv","id":"1711.02974","version":4},"attestation_state":"computed","paper":{"title":"Clustering with feature selection using alternating minimization, Application to computational biology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyprien Gilet, Jean-Baptiste Caillau, Marie Deprez, Michel Barlaud","submitted_at":"2017-11-08T14:42:55Z","abstract_excerpt":"This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse which alternates k-means with projection-gradient minimization. The projection-gradient step is a method of splitting type, with exact projection on the $\\ell^1$ ball to promote sparsity. The convergence "},"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":"1711.02974","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T14:42:55Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"34fa927f243697df500ee68cdbfd6805bfee6842600328e9f1894164a65df0cf","abstract_canon_sha256":"0fc488b68e6ccba2246e1cf5fce451dee4f8d0cca6344c9c6b6290a03a6666bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.639899Z","signature_b64":"9baRvZnxzKMDgeUShVwFzYCyZdcI+RH+/3pSQpJMNM+CnQEjuI/iGIUAr8iUvk4X5l3VgInBxDW0h7kwCLp/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf56f3da3e477407be8274e3c5b46d7f0ab9d2c4c094c5ed4207821aba3b6f8","last_reissued_at":"2026-05-17T23:45:15.639169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.639169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering with feature selection using alternating minimization, Application to computational biology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyprien Gilet, Jean-Baptiste Caillau, Marie Deprez, Michel Barlaud","submitted_at":"2017-11-08T14:42:55Z","abstract_excerpt":"This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse which alternates k-means with projection-gradient minimization. The projection-gradient step is a method of splitting type, with exact projection on the $\\ell^1$ ball to promote sparsity. The convergence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02974","kind":"arxiv","version":4},"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":"1711.02974","created_at":"2026-05-17T23:45:15.639275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02974v4","created_at":"2026-05-17T23:45:15.639275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02974","created_at":"2026-05-17T23:45:15.639275+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT2W6PND4R3U","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT2W6PND4R3UA67I","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT2W6PND","created_at":"2026-05-18T12:31:37.085036+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/PT2W6PND4R3UA67IE5HDYW2G27","json":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27.json","graph_json":"https://pith.science/api/pith-number/PT2W6PND4R3UA67IE5HDYW2G27/graph.json","events_json":"https://pith.science/api/pith-number/PT2W6PND4R3UA67IE5HDYW2G27/events.json","paper":"https://pith.science/paper/PT2W6PND"},"agent_actions":{"view_html":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27","download_json":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27.json","view_paper":"https://pith.science/paper/PT2W6PND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02974&json=true","fetch_graph":"https://pith.science/api/pith-number/PT2W6PND4R3UA67IE5HDYW2G27/graph.json","fetch_events":"https://pith.science/api/pith-number/PT2W6PND4R3UA67IE5HDYW2G27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/action/storage_attestation","attest_author":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/action/author_attestation","sign_citation":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/action/citation_signature","submit_replication":"https://pith.science/pith/PT2W6PND4R3UA67IE5HDYW2G27/action/replication_record"}},"created_at":"2026-05-17T23:45:15.639275+00:00","updated_at":"2026-05-17T23:45:15.639275+00:00"}