{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4BVMAPNXFPIBLOCER5B4VUQWOJ","short_pith_number":"pith:4BVMAPNX","schema_version":"1.0","canonical_sha256":"e06ac03db72bd015b8448f43cad216726b86ec1641373f9b8c5f452ee6aea19a","source":{"kind":"arxiv","id":"1902.00804","version":1},"attestation_state":"computed","paper":{"title":"Itemsets for Real-valued Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-02T22:21:53Z","abstract_excerpt":"Pattern mining is one of the most well-studied subfields in exploratory data analysis. While there is a significant amount of literature on how to discover and rank itemsets efficiently from binary data, there is surprisingly little research done in mining patterns from real-valued data. In this paper we propose a family of quality scores for real-valued itemsets. We approach the problem by considering casting the dataset into a binary data and computing the support from this data. This naive approach requires us to select thresholds. To remedy this, instead of selecting one set of thresholds,"},"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":"1902.00804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-02T22:21:53Z","cross_cats_sorted":[],"title_canon_sha256":"8c1b713338cf03a6dbf714f0a624ae99beb54a4918199c0e3a43b0305c6f5eb5","abstract_canon_sha256":"23145b8fb4b945ae89f36b91db5bfbeef95aa880d52f1a63f23513c01e6d3dd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.084891Z","signature_b64":"1TJPWKb4WO6yJTdMWnmQ/OyEhx5FyixidCP6ik38ZX195aJPgCJLNnbFDxWKnJz8isATMrRFMXWICdq67JtUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e06ac03db72bd015b8448f43cad216726b86ec1641373f9b8c5f452ee6aea19a","last_reissued_at":"2026-05-17T23:54:52.084390Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.084390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Itemsets for Real-valued Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-02T22:21:53Z","abstract_excerpt":"Pattern mining is one of the most well-studied subfields in exploratory data analysis. While there is a significant amount of literature on how to discover and rank itemsets efficiently from binary data, there is surprisingly little research done in mining patterns from real-valued data. In this paper we propose a family of quality scores for real-valued itemsets. We approach the problem by considering casting the dataset into a binary data and computing the support from this data. This naive approach requires us to select thresholds. To remedy this, instead of selecting one set of thresholds,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00804","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":"1902.00804","created_at":"2026-05-17T23:54:52.084480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00804v1","created_at":"2026-05-17T23:54:52.084480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00804","created_at":"2026-05-17T23:54:52.084480+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BVMAPNXFPIB","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BVMAPNXFPIBLOCE","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BVMAPNX","created_at":"2026-05-18T12:33:10.108867+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/4BVMAPNXFPIBLOCER5B4VUQWOJ","json":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ.json","graph_json":"https://pith.science/api/pith-number/4BVMAPNXFPIBLOCER5B4VUQWOJ/graph.json","events_json":"https://pith.science/api/pith-number/4BVMAPNXFPIBLOCER5B4VUQWOJ/events.json","paper":"https://pith.science/paper/4BVMAPNX"},"agent_actions":{"view_html":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ","download_json":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ.json","view_paper":"https://pith.science/paper/4BVMAPNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00804&json=true","fetch_graph":"https://pith.science/api/pith-number/4BVMAPNXFPIBLOCER5B4VUQWOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4BVMAPNXFPIBLOCER5B4VUQWOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ/action/storage_attestation","attest_author":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ/action/author_attestation","sign_citation":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ/action/citation_signature","submit_replication":"https://pith.science/pith/4BVMAPNXFPIBLOCER5B4VUQWOJ/action/replication_record"}},"created_at":"2026-05-17T23:54:52.084480+00:00","updated_at":"2026-05-17T23:54:52.084480+00:00"}