arXiv Open Access 2019

Frequent Itemset Mining using QUBO

Jonas Nüßlein

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DB

Penulis (1)

Jonas Nüßlein

Format Sitasi

APA MLA BibTeX

Nüßlein, J. (2019). Frequent Itemset Mining using QUBO. https://arxiv.org/abs/1904.07693

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓