Quantum algorithm for association rules mining
Chao-Hua Yu, Fei Gao, Qing-Le Wang, Qiao-Yan Wen

TL;DR
This paper introduces a quantum algorithm for association rules mining that significantly improves the efficiency of discovering frequent itemsets and estimating their supports compared to classical methods, especially in large datasets.
Contribution
The paper presents a quantum algorithm that quadratically improves the complexity of mining frequent itemsets and estimating supports in association rules mining.
Findings
Quantum algorithm achieves quadratic speedup over classical sampling methods.
Complexity depends on the number of candidate and frequent itemsets, and the error margin.
Performance is especially improved when the number of frequent itemsets is much smaller than candidates.
Abstract
Association rules mining (ARM) is one of the most important problems in knowledge discovery and data mining. Given a transaction database that has a large number of transactions and items, the task of ARM is to acquire consumption habits of customers by discovering the relationships between itemsets (sets of items). In this paper, we address ARM in the quantum settings and propose a quantum algorithm for the key part of ARM, finding out frequent itemsets from the candidate itemsets and acquiring their supports. Specifically, for the case in which there are frequent -itemsets in the candidate -itemsets (), our algorithm can efficiently mine these frequent -itemsets and estimate their supports by using parallel amplitude estimation and amplitude amplification with complexity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
