arXiv Open Access 2014

A Fast Minimal Infrequent Itemset Mining Algorithm

Kostyantyn Demchuk Douglas J. Leith

Lihat Sumber

Abstrak

A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in run-time relative to the state of the art and the scalability of the algorithm to realistically-sized datasets up to several million records.

Topik & Kata Kunci

cs.DB

Penulis (2)

Kostyantyn Demchuk

Douglas J. Leith

Format Sitasi

APA MLA BibTeX

Demchuk, K., Leith, D.J. (2014). A Fast Minimal Infrequent Itemset Mining Algorithm. https://arxiv.org/abs/1403.6985

Akses Cepat

Lihat di Sumber

Informasi Jurnal

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