{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KDWR73GPK2UYZUIXGNGZK7BHOW","short_pith_number":"pith:KDWR73GP","schema_version":"1.0","canonical_sha256":"50ed1feccf56a98cd117334d957c27758120f1e80d266110841a444423cbcec4","source":{"kind":"arxiv","id":"1704.02197","version":2},"attestation_state":"computed","paper":{"title":"Variance Based Moving K-Means Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amarjot Singh, Raghunath Vp, SN Omar, Vibin Vijay","submitted_at":"2017-04-07T12:10:39Z","abstract_excerpt":"Clustering is a useful data exploratory method with its wide applicability in multiple fields. However, data clustering greatly relies on initialization of cluster centers that can result in large intra-cluster variance and dead centers, therefore leading to sub-optimal solutions. This paper proposes a novel variance based version of the conventional Moving K-Means (MKM) algorithm called Variance Based Moving K-Means (VMKM) that can partition data into optimal homogeneous clusters, irrespective of cluster initialization. The algorithm utilizes a novel distance metric and a unique data element "},"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":"1704.02197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-07T12:10:39Z","cross_cats_sorted":[],"title_canon_sha256":"61f60003d35bcf113b5726bac69748c8fc74e45ef9552763459a09b5df0c75f3","abstract_canon_sha256":"0a63e0beb5eeda796d9a6d4b8440c466e4c050167ccd7678c3c14778c7ef222d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:38.475665Z","signature_b64":"t2MIai42tLb15g0LU8KiDSteqd3cX0IeuV4ZdrhqpCFkHObK/S1LTEZKWiHwTAwxl5hx9cZWZgQW46wJWfqUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ed1feccf56a98cd117334d957c27758120f1e80d266110841a444423cbcec4","last_reissued_at":"2026-05-18T00:44:38.475226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:38.475226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variance Based Moving K-Means Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amarjot Singh, Raghunath Vp, SN Omar, Vibin Vijay","submitted_at":"2017-04-07T12:10:39Z","abstract_excerpt":"Clustering is a useful data exploratory method with its wide applicability in multiple fields. However, data clustering greatly relies on initialization of cluster centers that can result in large intra-cluster variance and dead centers, therefore leading to sub-optimal solutions. This paper proposes a novel variance based version of the conventional Moving K-Means (MKM) algorithm called Variance Based Moving K-Means (VMKM) that can partition data into optimal homogeneous clusters, irrespective of cluster initialization. The algorithm utilizes a novel distance metric and a unique data element "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02197","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":"1704.02197","created_at":"2026-05-18T00:44:38.475299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02197v2","created_at":"2026-05-18T00:44:38.475299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02197","created_at":"2026-05-18T00:44:38.475299+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDWR73GPK2UY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDWR73GPK2UYZUIX","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDWR73GP","created_at":"2026-05-18T12:31:24.725408+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/KDWR73GPK2UYZUIXGNGZK7BHOW","json":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW.json","graph_json":"https://pith.science/api/pith-number/KDWR73GPK2UYZUIXGNGZK7BHOW/graph.json","events_json":"https://pith.science/api/pith-number/KDWR73GPK2UYZUIXGNGZK7BHOW/events.json","paper":"https://pith.science/paper/KDWR73GP"},"agent_actions":{"view_html":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW","download_json":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW.json","view_paper":"https://pith.science/paper/KDWR73GP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02197&json=true","fetch_graph":"https://pith.science/api/pith-number/KDWR73GPK2UYZUIXGNGZK7BHOW/graph.json","fetch_events":"https://pith.science/api/pith-number/KDWR73GPK2UYZUIXGNGZK7BHOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW/action/storage_attestation","attest_author":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW/action/author_attestation","sign_citation":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW/action/citation_signature","submit_replication":"https://pith.science/pith/KDWR73GPK2UYZUIXGNGZK7BHOW/action/replication_record"}},"created_at":"2026-05-18T00:44:38.475299+00:00","updated_at":"2026-05-18T00:44:38.475299+00:00"}