{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74WM6JBWELEM3S6QO7V5R3PNP4","short_pith_number":"pith:74WM6JBW","schema_version":"1.0","canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","source":{"kind":"arxiv","id":"1811.02722","version":1},"attestation_state":"computed","paper":{"title":"Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Leckie, Jianzhong Qi, Minh Tuan Doan, Sutharshan Rajasegarar","submitted_at":"2018-11-07T01:54:39Z","abstract_excerpt":"Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from a high dimensional dataset. It has a wide range of applications, such as analysing high dimensional sensor data or DNA sequences. However, existing algorithms have limitations in finding clusters in non-disjoint subspaces and scaling to large data, which impinge their applicability in areas such as bioinformatics and the Internet of Things. We aim to address such limitations by proposing a subspace clustering algorithm using a bottom-up strategy. Our algorithm first searches for"},"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.02722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T01:54:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"606b522deb3ecde455c3f58907d904124ed9da9f163fe2756c8453adc332796d","abstract_canon_sha256":"a768fe5f674e810913adcad8f3177cdb5c19d12acbfecf96569d26fc0d5c32a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.946680Z","signature_b64":"lCEwGFRkf/Wy6VGxuHZHybGQhZFcigVHz5a3yDFTRiosb0/HFOY+aafVY0kERIz0NFPsYNmZm/xOSR+SlUF4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2ccf243622c8cdcbd077ebd8eded7f187b3f44317545d8cc9a87e124dfbe2c","last_reissued_at":"2026-05-18T00:01:20.946176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.946176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Leckie, Jianzhong Qi, Minh Tuan Doan, Sutharshan Rajasegarar","submitted_at":"2018-11-07T01:54:39Z","abstract_excerpt":"Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from a high dimensional dataset. It has a wide range of applications, such as analysing high dimensional sensor data or DNA sequences. However, existing algorithms have limitations in finding clusters in non-disjoint subspaces and scaling to large data, which impinge their applicability in areas such as bioinformatics and the Internet of Things. We aim to address such limitations by proposing a subspace clustering algorithm using a bottom-up strategy. Our algorithm first searches for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02722","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.02722","created_at":"2026-05-18T00:01:20.946245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02722v1","created_at":"2026-05-18T00:01:20.946245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02722","created_at":"2026-05-18T00:01:20.946245+00:00"},{"alias_kind":"pith_short_12","alias_value":"74WM6JBWELEM","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"74WM6JBWELEM3S6Q","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"74WM6JBW","created_at":"2026-05-18T12:32:11.075285+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/74WM6JBWELEM3S6QO7V5R3PNP4","json":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4.json","graph_json":"https://pith.science/api/pith-number/74WM6JBWELEM3S6QO7V5R3PNP4/graph.json","events_json":"https://pith.science/api/pith-number/74WM6JBWELEM3S6QO7V5R3PNP4/events.json","paper":"https://pith.science/paper/74WM6JBW"},"agent_actions":{"view_html":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4","download_json":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4.json","view_paper":"https://pith.science/paper/74WM6JBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02722&json=true","fetch_graph":"https://pith.science/api/pith-number/74WM6JBWELEM3S6QO7V5R3PNP4/graph.json","fetch_events":"https://pith.science/api/pith-number/74WM6JBWELEM3S6QO7V5R3PNP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/action/storage_attestation","attest_author":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/action/author_attestation","sign_citation":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/action/citation_signature","submit_replication":"https://pith.science/pith/74WM6JBWELEM3S6QO7V5R3PNP4/action/replication_record"}},"created_at":"2026-05-18T00:01:20.946245+00:00","updated_at":"2026-05-18T00:01:20.946245+00:00"}