{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WAKMS7VBS7TAMLI4VI2NJLNTHP","short_pith_number":"pith:WAKMS7VB","schema_version":"1.0","canonical_sha256":"b014c97ea197e6062d1caa34d4adb33be9909eaf5dede63d44e40ae0833590b5","source":{"kind":"arxiv","id":"1406.4751","version":1},"attestation_state":"computed","paper":{"title":"Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Lopamudra Dey, N.K.Nagwani, Sanjay Chakraborty","submitted_at":"2014-06-18T15:00:53Z","abstract_excerpt":"Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the perf"},"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":"1406.4751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-06-18T15:00:53Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"7adff04b945c1a9fdd7a74ad21bbd142b0a7d3d04a29c98e04ef92742dcf9023","abstract_canon_sha256":"0b688a0386c229f51ad6adf984a8735993977643419c9ce8c18cbba8b7fb87f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.866062Z","signature_b64":"0SbhIMS98NS95tizBJQ7nbxuSAanrfWJjmVW/O+FINTbvxcd4LoYJkpyvJgihTDKIfTVVcfrBpvxT1soAD73AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b014c97ea197e6062d1caa34d4adb33be9909eaf5dede63d44e40ae0833590b5","last_reissued_at":"2026-05-18T02:49:30.865602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.865602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Lopamudra Dey, N.K.Nagwani, Sanjay Chakraborty","submitted_at":"2014-06-18T15:00:53Z","abstract_excerpt":"Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4751","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":"1406.4751","created_at":"2026-05-18T02:49:30.865670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4751v1","created_at":"2026-05-18T02:49:30.865670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4751","created_at":"2026-05-18T02:49:30.865670+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAKMS7VBS7TA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAKMS7VBS7TAMLI4","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAKMS7VB","created_at":"2026-05-18T12:28:54.890064+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/WAKMS7VBS7TAMLI4VI2NJLNTHP","json":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP.json","graph_json":"https://pith.science/api/pith-number/WAKMS7VBS7TAMLI4VI2NJLNTHP/graph.json","events_json":"https://pith.science/api/pith-number/WAKMS7VBS7TAMLI4VI2NJLNTHP/events.json","paper":"https://pith.science/paper/WAKMS7VB"},"agent_actions":{"view_html":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP","download_json":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP.json","view_paper":"https://pith.science/paper/WAKMS7VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4751&json=true","fetch_graph":"https://pith.science/api/pith-number/WAKMS7VBS7TAMLI4VI2NJLNTHP/graph.json","fetch_events":"https://pith.science/api/pith-number/WAKMS7VBS7TAMLI4VI2NJLNTHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP/action/storage_attestation","attest_author":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP/action/author_attestation","sign_citation":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP/action/citation_signature","submit_replication":"https://pith.science/pith/WAKMS7VBS7TAMLI4VI2NJLNTHP/action/replication_record"}},"created_at":"2026-05-18T02:49:30.865670+00:00","updated_at":"2026-05-18T02:49:30.865670+00:00"}