{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KS3KIWPQOWVN3JB246YWERQTVD","short_pith_number":"pith:KS3KIWPQ","schema_version":"1.0","canonical_sha256":"54b6a459f075aadda43ae7b1624613a8e71414b10383da82aa4e57f5f77704bd","source":{"kind":"arxiv","id":"1908.06699","version":4},"attestation_state":"computed","paper":{"title":"Robust and Efficient Fuzzy C-Means Clustering Constrained on Flexible Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Jinglin Xu, Junwei Han, Mingliang Xu, Xuelong Li","submitted_at":"2019-08-19T11:17:42Z","abstract_excerpt":"Clustering is an effective technique in data mining to group a set of objects in terms of some attributes. Among various clustering approaches, the family of K-Means algorithms gains popularity due to simplicity and efficiency. However, most of existing K-Means based clustering algorithms cannot deal with outliers well and are difficult to efficiently solve the problem embedded the $L_0$-norm constraint. To address the above issues and improve the performance of clustering significantly, we propose a novel clustering algorithm, named REFCMFS, which develops a $L_{2,1}$-norm robust loss as the "},"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":"1908.06699","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-19T11:17:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a7c14a8930f4fbcc7dc02ce2934ed2c5ffb94d8167bd3527d929bc912c8951e7","abstract_canon_sha256":"002cb905a1dd5778e84fe5d0fd73a9eaf6d7f243c05a0b96902d01e78e50279f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:28.608024Z","signature_b64":"Uc3RThYFc6kruc+0E4UEkxhVKtpdYMaM/g5g+Hr1Fs9j8f4NqSpD2JtQ4oxxhfR08241wgaeB+3mnYRa/+tqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54b6a459f075aadda43ae7b1624613a8e71414b10383da82aa4e57f5f77704bd","last_reissued_at":"2026-07-05T00:02:28.607568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:28.607568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Efficient Fuzzy C-Means Clustering Constrained on Flexible Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Jinglin Xu, Junwei Han, Mingliang Xu, Xuelong Li","submitted_at":"2019-08-19T11:17:42Z","abstract_excerpt":"Clustering is an effective technique in data mining to group a set of objects in terms of some attributes. Among various clustering approaches, the family of K-Means algorithms gains popularity due to simplicity and efficiency. However, most of existing K-Means based clustering algorithms cannot deal with outliers well and are difficult to efficiently solve the problem embedded the $L_0$-norm constraint. To address the above issues and improve the performance of clustering significantly, we propose a novel clustering algorithm, named REFCMFS, which develops a $L_{2,1}$-norm robust loss as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06699","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06699/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06699","created_at":"2026-07-05T00:02:28.607635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06699v4","created_at":"2026-07-05T00:02:28.607635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06699","created_at":"2026-07-05T00:02:28.607635+00:00"},{"alias_kind":"pith_short_12","alias_value":"KS3KIWPQOWVN","created_at":"2026-07-05T00:02:28.607635+00:00"},{"alias_kind":"pith_short_16","alias_value":"KS3KIWPQOWVN3JB2","created_at":"2026-07-05T00:02:28.607635+00:00"},{"alias_kind":"pith_short_8","alias_value":"KS3KIWPQ","created_at":"2026-07-05T00:02:28.607635+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/KS3KIWPQOWVN3JB246YWERQTVD","json":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD.json","graph_json":"https://pith.science/api/pith-number/KS3KIWPQOWVN3JB246YWERQTVD/graph.json","events_json":"https://pith.science/api/pith-number/KS3KIWPQOWVN3JB246YWERQTVD/events.json","paper":"https://pith.science/paper/KS3KIWPQ"},"agent_actions":{"view_html":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD","download_json":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD.json","view_paper":"https://pith.science/paper/KS3KIWPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06699&json=true","fetch_graph":"https://pith.science/api/pith-number/KS3KIWPQOWVN3JB246YWERQTVD/graph.json","fetch_events":"https://pith.science/api/pith-number/KS3KIWPQOWVN3JB246YWERQTVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD/action/storage_attestation","attest_author":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD/action/author_attestation","sign_citation":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD/action/citation_signature","submit_replication":"https://pith.science/pith/KS3KIWPQOWVN3JB246YWERQTVD/action/replication_record"}},"created_at":"2026-07-05T00:02:28.607635+00:00","updated_at":"2026-07-05T00:02:28.607635+00:00"}