{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L7VJRCUWSKX6Y2RTRFDQZCXKAO","short_pith_number":"pith:L7VJRCUW","schema_version":"1.0","canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","source":{"kind":"arxiv","id":"1811.07615","version":1},"attestation_state":"computed","paper":{"title":"An efficient density-based clustering algorithm using reverse nearest neighbour","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Renato Cordeiro de Amorim, Stiphen Chowdhury","submitted_at":"2018-11-19T11:11:14Z","abstract_excerpt":"Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the two parameters. In this paper we present a new density-based clustering algorithm which uses reverse nearest neighbour (RNN) and has a single parameter. We also show that it is possible to estimate a good value for this parameter using a clustering validity index. The RNN queries "},"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":"1811.07615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T11:11:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6892fa9f2761b9d58a22a4fa99c82b9da0f7c49fc291d36add96e17ffc1b9204","abstract_canon_sha256":"d0fe0aa65be97f47de04c2154f712dbfb8774b3b89a10caf75791bcf4230c960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.960698Z","signature_b64":"r/564pvho5LcDSMRWgVcPB0Vo0T8ZkwURg7ogrcwoRGlggVgsvr1FO2uma81RP9iJewbgRcX10paGEoQNrJcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fea988a9692afec6a3389470c8aea03aeb092ae4990874396c2a8a7df33d140","last_reissued_at":"2026-05-18T00:00:23.960104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.960104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient density-based clustering algorithm using reverse nearest neighbour","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Renato Cordeiro de Amorim, Stiphen Chowdhury","submitted_at":"2018-11-19T11:11:14Z","abstract_excerpt":"Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the two parameters. In this paper we present a new density-based clustering algorithm which uses reverse nearest neighbour (RNN) and has a single parameter. We also show that it is possible to estimate a good value for this parameter using a clustering validity index. The RNN queries "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07615","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":"1811.07615","created_at":"2026-05-18T00:00:23.960215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07615v1","created_at":"2026-05-18T00:00:23.960215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07615","created_at":"2026-05-18T00:00:23.960215+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7VJRCUWSKX6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7VJRCUWSKX6Y2RT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7VJRCUW","created_at":"2026-05-18T12:32:33.847187+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/L7VJRCUWSKX6Y2RTRFDQZCXKAO","json":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO.json","graph_json":"https://pith.science/api/pith-number/L7VJRCUWSKX6Y2RTRFDQZCXKAO/graph.json","events_json":"https://pith.science/api/pith-number/L7VJRCUWSKX6Y2RTRFDQZCXKAO/events.json","paper":"https://pith.science/paper/L7VJRCUW"},"agent_actions":{"view_html":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO","download_json":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO.json","view_paper":"https://pith.science/paper/L7VJRCUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07615&json=true","fetch_graph":"https://pith.science/api/pith-number/L7VJRCUWSKX6Y2RTRFDQZCXKAO/graph.json","fetch_events":"https://pith.science/api/pith-number/L7VJRCUWSKX6Y2RTRFDQZCXKAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/action/storage_attestation","attest_author":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/action/author_attestation","sign_citation":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/action/citation_signature","submit_replication":"https://pith.science/pith/L7VJRCUWSKX6Y2RTRFDQZCXKAO/action/replication_record"}},"created_at":"2026-05-18T00:00:23.960215+00:00","updated_at":"2026-05-18T00:00:23.960215+00:00"}