A Fast Minimal Infrequent Itemset Mining Algorithm
Databases
2014-10-17 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1403.6985,
title = {A Fast Minimal Infrequent Itemset Mining Algorithm},
author = {Kostyantyn Demchuk and Douglas J. Leith},
journal= {arXiv preprint arXiv:1403.6985},
year = {2014}
}