A Fast Minimal Infrequent Itemset Mining Algorithm
classification
💻 cs.DB
keywords
algorithmdatasetsfastbroaddemonstratefindingidentifiersinfrequent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.