Frequent Itemset Mining using QUBO

Jonas Nüßlein

Frequent Itemset Mining using QUBO

Databases 2022-11-29 v3

Authors: Jonas Nüßlein

Abstract

In this paper we propose a R-step approximation to solve frequent itemset mining on quantum hardware like quantum annealing or QAOA. The idea is to search for the set of items where the minimal 2-item frequency is maximal. This can be represented as a maximum clique problem.

Cite

@article{arxiv.1904.07693,
  title  = {Frequent Itemset Mining using QUBO},
  author = {Jonas Nüßlein},
  journal= {arXiv preprint arXiv:1904.07693},
  year   = {2022}
}

Related papers

View all related →