{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D3Q5VPYBOAUJBOVM3XXF5LEDSJ","short_pith_number":"pith:D3Q5VPYB","schema_version":"1.0","canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","source":{"kind":"arxiv","id":"1503.01183","version":2},"attestation_state":"computed","paper":{"title":"A General Hybrid Clustering Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bertrand Clarke, Hoyt A. Koepke, Jennifer Clarke, Saeid Amiri","submitted_at":"2015-03-04T01:08:17Z","abstract_excerpt":"Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters $K$, we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly selected). They key steps are to find a $K$-means clustering using $K_\\ell$ clusters where $K_\\ell \\gg K$ and then joins these small clusters by using single linkage clustering. The second stage stabilizes the result of stage one by reclustering via the `membership matrix' under Ha"},"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":"1503.01183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-04T01:08:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2fa24292007d69b542f8023b170c5d8f2e898d7e87d83b4730290410d41c0177","abstract_canon_sha256":"08d35f9c2fa1fb15ce5f11a35879bb7d5886527a1a2924e5b173e100c7880988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.591810Z","signature_b64":"YS8huyNrSVmgan0alOWjzdRJhQxiIf5Ej/WQSjkq3PIFaRLq4XdoKI8wgWw+yYEQzGYM/Fw5wHulciwNZm8SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee1dabf01702890baacddee5eac8392600aa35634a8137bb15f0749e365bc5c","last_reissued_at":"2026-05-18T02:25:27.591364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.591364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Hybrid Clustering Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bertrand Clarke, Hoyt A. Koepke, Jennifer Clarke, Saeid Amiri","submitted_at":"2015-03-04T01:08:17Z","abstract_excerpt":"Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters $K$, we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly selected). They key steps are to find a $K$-means clustering using $K_\\ell$ clusters where $K_\\ell \\gg K$ and then joins these small clusters by using single linkage clustering. The second stage stabilizes the result of stage one by reclustering via the `membership matrix' under Ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01183","kind":"arxiv","version":2},"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":"1503.01183","created_at":"2026-05-18T02:25:27.591439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01183v2","created_at":"2026-05-18T02:25:27.591439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01183","created_at":"2026-05-18T02:25:27.591439+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3Q5VPYBOAUJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3Q5VPYBOAUJBOVM","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3Q5VPYB","created_at":"2026-05-18T12:29:17.054201+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/D3Q5VPYBOAUJBOVM3XXF5LEDSJ","json":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ.json","graph_json":"https://pith.science/api/pith-number/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/graph.json","events_json":"https://pith.science/api/pith-number/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/events.json","paper":"https://pith.science/paper/D3Q5VPYB"},"agent_actions":{"view_html":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ","download_json":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ.json","view_paper":"https://pith.science/paper/D3Q5VPYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01183&json=true","fetch_graph":"https://pith.science/api/pith-number/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/action/storage_attestation","attest_author":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/action/author_attestation","sign_citation":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/action/citation_signature","submit_replication":"https://pith.science/pith/D3Q5VPYBOAUJBOVM3XXF5LEDSJ/action/replication_record"}},"created_at":"2026-05-18T02:25:27.591439+00:00","updated_at":"2026-05-18T02:25:27.591439+00:00"}