{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DY32JX3YUJ5LLVTF5EER6KILMJ","short_pith_number":"pith:DY32JX3Y","schema_version":"1.0","canonical_sha256":"1e37a4df78a27ab5d665e9091f290b62754a130f0dd5741a21da28fa3e3106be","source":{"kind":"arxiv","id":"1912.06432","version":2},"attestation_state":"computed","paper":{"title":"A Bayesian Approach to Rule Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.AI","authors_text":"Adrian Derungs, Erlangen, Germany), Luis Ignacio Lopera Gonz\\'alez, Oliver Amft (Friedrich-Alexander University Erlangen-N\\\"urnberg","submitted_at":"2019-12-13T12:06:38Z","abstract_excerpt":"In this paper, we introduce the increasing belief criterion in association rule mining. The criterion uses a recursive application of Bayes' theorem to compute a rule's belief. Extracted rules are required to have their belief increase with their last observation. We extend the taxonomy of association rule mining algorithms with a new branch for Bayesian rule mining~(BRM), which uses increasing belief as the rule selection criterion. In contrast, the well-established frequent association rule mining~(FRM) branch relies on the minimum-support concept to extract rules. We derive properties of 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":"1912.06432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-13T12:06:38Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"29c35ddb9674c840e8b4d180befe3024d045a4483ab9e3b00f78870454f3a5b8","abstract_canon_sha256":"18db7a569b38433fc97f176b9dc00e9c259106c0790acd5be9da7d6c5ab749e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:02.872850Z","signature_b64":"LiiNyBSVuM70GWudzbeNHivcqiF56dbSDesgq6UDNs86xhGVki3+aXFWR4aGeN/5E0BXXee5Hd/q+KYJC0SsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e37a4df78a27ab5d665e9091f290b62754a130f0dd5741a21da28fa3e3106be","last_reissued_at":"2026-07-05T00:33:02.872289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:02.872289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bayesian Approach to Rule Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.AI","authors_text":"Adrian Derungs, Erlangen, Germany), Luis Ignacio Lopera Gonz\\'alez, Oliver Amft (Friedrich-Alexander University Erlangen-N\\\"urnberg","submitted_at":"2019-12-13T12:06:38Z","abstract_excerpt":"In this paper, we introduce the increasing belief criterion in association rule mining. The criterion uses a recursive application of Bayes' theorem to compute a rule's belief. Extracted rules are required to have their belief increase with their last observation. We extend the taxonomy of association rule mining algorithms with a new branch for Bayesian rule mining~(BRM), which uses increasing belief as the rule selection criterion. In contrast, the well-established frequent association rule mining~(FRM) branch relies on the minimum-support concept to extract rules. We derive properties of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06432","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.06432/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.06432","created_at":"2026-07-05T00:33:02.872357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06432v2","created_at":"2026-07-05T00:33:02.872357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06432","created_at":"2026-07-05T00:33:02.872357+00:00"},{"alias_kind":"pith_short_12","alias_value":"DY32JX3YUJ5L","created_at":"2026-07-05T00:33:02.872357+00:00"},{"alias_kind":"pith_short_16","alias_value":"DY32JX3YUJ5LLVTF","created_at":"2026-07-05T00:33:02.872357+00:00"},{"alias_kind":"pith_short_8","alias_value":"DY32JX3Y","created_at":"2026-07-05T00:33:02.872357+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/DY32JX3YUJ5LLVTF5EER6KILMJ","json":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ.json","graph_json":"https://pith.science/api/pith-number/DY32JX3YUJ5LLVTF5EER6KILMJ/graph.json","events_json":"https://pith.science/api/pith-number/DY32JX3YUJ5LLVTF5EER6KILMJ/events.json","paper":"https://pith.science/paper/DY32JX3Y"},"agent_actions":{"view_html":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ","download_json":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ.json","view_paper":"https://pith.science/paper/DY32JX3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06432&json=true","fetch_graph":"https://pith.science/api/pith-number/DY32JX3YUJ5LLVTF5EER6KILMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DY32JX3YUJ5LLVTF5EER6KILMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ/action/storage_attestation","attest_author":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ/action/author_attestation","sign_citation":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ/action/citation_signature","submit_replication":"https://pith.science/pith/DY32JX3YUJ5LLVTF5EER6KILMJ/action/replication_record"}},"created_at":"2026-07-05T00:33:02.872357+00:00","updated_at":"2026-07-05T00:33:02.872357+00:00"}