{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X2S5XAQ3E6IJFPIKJCIJFWYUSY","short_pith_number":"pith:X2S5XAQ3","schema_version":"1.0","canonical_sha256":"bea5db821b279092bd0a489092db1496388266568032c1732f2d663d6a4450f3","source":{"kind":"arxiv","id":"1702.02262","version":1},"attestation_state":"computed","paper":{"title":"Clustering For Point Pattern Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ba-Ngu Vo, Ba-Tuong Vo, Dinh Phung, Quang N. Tran","submitted_at":"2017-02-08T03:21:22Z","abstract_excerpt":"Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elements - that are found in numerous applications and data sources. In this paper, we propose two approaches for clustering point patterns. The first is a non-parametric method based on novel distances for sets. The second is a model-based approach, formulated via random finite set th"},"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":"1702.02262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-08T03:21:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b30bc7d9603d1bda7407d0fbf922f12a0cf7a14d3d74fa7c930161542b6b6352","abstract_canon_sha256":"f7906dcda9baf47b6365b3ae22deb7cc3ded8e4311d5bb4d8594f7507e1f3d82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.372365Z","signature_b64":"71n5qc00P+vsiFLcvQpsj+VZ10oYZrn+Ca7TIEVXcdUIBOvXZlytPDD63hZEC2imveeVGozuZjzQDHAjgBqJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bea5db821b279092bd0a489092db1496388266568032c1732f2d663d6a4450f3","last_reissued_at":"2026-05-18T00:51:06.371865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.371865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering For Point Pattern Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ba-Ngu Vo, Ba-Tuong Vo, Dinh Phung, Quang N. Tran","submitted_at":"2017-02-08T03:21:22Z","abstract_excerpt":"Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elements - that are found in numerous applications and data sources. In this paper, we propose two approaches for clustering point patterns. The first is a non-parametric method based on novel distances for sets. The second is a model-based approach, formulated via random finite set th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02262","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":"1702.02262","created_at":"2026-05-18T00:51:06.371941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02262v1","created_at":"2026-05-18T00:51:06.371941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02262","created_at":"2026-05-18T00:51:06.371941+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2S5XAQ3E6IJ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2S5XAQ3E6IJFPIK","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2S5XAQ3","created_at":"2026-05-18T12:31:53.515858+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/X2S5XAQ3E6IJFPIKJCIJFWYUSY","json":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY.json","graph_json":"https://pith.science/api/pith-number/X2S5XAQ3E6IJFPIKJCIJFWYUSY/graph.json","events_json":"https://pith.science/api/pith-number/X2S5XAQ3E6IJFPIKJCIJFWYUSY/events.json","paper":"https://pith.science/paper/X2S5XAQ3"},"agent_actions":{"view_html":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY","download_json":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY.json","view_paper":"https://pith.science/paper/X2S5XAQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/X2S5XAQ3E6IJFPIKJCIJFWYUSY/graph.json","fetch_events":"https://pith.science/api/pith-number/X2S5XAQ3E6IJFPIKJCIJFWYUSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY/action/storage_attestation","attest_author":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY/action/author_attestation","sign_citation":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY/action/citation_signature","submit_replication":"https://pith.science/pith/X2S5XAQ3E6IJFPIKJCIJFWYUSY/action/replication_record"}},"created_at":"2026-05-18T00:51:06.371941+00:00","updated_at":"2026-05-18T00:51:06.371941+00:00"}