{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A7JOSROQAY75KTNC7RIGG2AP4G","short_pith_number":"pith:A7JOSROQ","schema_version":"1.0","canonical_sha256":"07d2e945d0063fd54da2fc5063680fe1a2dc663f9da4993fe61c6e382ae9b7a1","source":{"kind":"arxiv","id":"1705.04249","version":1},"attestation_state":"computed","paper":{"title":"K-sets+: a Linear-time Clustering Algorithm for Data Points with a Sparse Similarity Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cheng-Shang Chang, Chia-Tai Chang, Duan-Shin Lee, Li-Heng Liou","submitted_at":"2017-05-11T15:39:48Z","abstract_excerpt":"In this paper, we first propose a new iterative algorithm, called the K-sets+ algorithm for clustering data points in a semi-metric space, where the distance measure does not necessarily satisfy the triangular inequality. We show that the K-sets+ algorithm converges in a finite number of iterations and it retains the same performance guarantee as the K-sets algorithm for clustering data points in a metric space. We then extend the applicability of the K-sets+ algorithm from data points in a semi-metric space to data points that only have a symmetric similarity measure. Such an extension leads "},"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":"1705.04249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T15:39:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a27749e7a3474f6cce50b32711c0035eabc6452dfc2e32d26b211c30327a95e7","abstract_canon_sha256":"2edf9e5d42e64eaae5d9e257ee8c270698963ee15eeb2838c0a9b0ca7652c043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.389376Z","signature_b64":"Rr79QnXpBGPhYznCZQbA06b+Cv78DvWKMaZNCAOGQ3SH12wPpHK3qyW01nQxQWVBaCfKxEvB7sUgPYTgado9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d2e945d0063fd54da2fc5063680fe1a2dc663f9da4993fe61c6e382ae9b7a1","last_reissued_at":"2026-05-18T00:44:39.388833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.388833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-sets+: a Linear-time Clustering Algorithm for Data Points with a Sparse Similarity Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cheng-Shang Chang, Chia-Tai Chang, Duan-Shin Lee, Li-Heng Liou","submitted_at":"2017-05-11T15:39:48Z","abstract_excerpt":"In this paper, we first propose a new iterative algorithm, called the K-sets+ algorithm for clustering data points in a semi-metric space, where the distance measure does not necessarily satisfy the triangular inequality. We show that the K-sets+ algorithm converges in a finite number of iterations and it retains the same performance guarantee as the K-sets algorithm for clustering data points in a metric space. We then extend the applicability of the K-sets+ algorithm from data points in a semi-metric space to data points that only have a symmetric similarity measure. Such an extension leads "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04249","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":"1705.04249","created_at":"2026-05-18T00:44:39.388913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04249v1","created_at":"2026-05-18T00:44:39.388913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04249","created_at":"2026-05-18T00:44:39.388913+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7JOSROQAY75","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7JOSROQAY75KTNC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7JOSROQ","created_at":"2026-05-18T12:31:05.417338+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/A7JOSROQAY75KTNC7RIGG2AP4G","json":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G.json","graph_json":"https://pith.science/api/pith-number/A7JOSROQAY75KTNC7RIGG2AP4G/graph.json","events_json":"https://pith.science/api/pith-number/A7JOSROQAY75KTNC7RIGG2AP4G/events.json","paper":"https://pith.science/paper/A7JOSROQ"},"agent_actions":{"view_html":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G","download_json":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G.json","view_paper":"https://pith.science/paper/A7JOSROQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04249&json=true","fetch_graph":"https://pith.science/api/pith-number/A7JOSROQAY75KTNC7RIGG2AP4G/graph.json","fetch_events":"https://pith.science/api/pith-number/A7JOSROQAY75KTNC7RIGG2AP4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G/action/storage_attestation","attest_author":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G/action/author_attestation","sign_citation":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G/action/citation_signature","submit_replication":"https://pith.science/pith/A7JOSROQAY75KTNC7RIGG2AP4G/action/replication_record"}},"created_at":"2026-05-18T00:44:39.388913+00:00","updated_at":"2026-05-18T00:44:39.388913+00:00"}