Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
Data Swapping: Balancing Privacy against Precision in Mining for Logic Rules
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
A computational algorithm for handling the special uniques problem
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Autonomous performance control of distributed applications in a heterogeneous environment
Proceedings of the 1st international conference on Autonomic computing and communication systems
Posterior distributions for rare events in multivariate categorical data
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Testing of IHSN c++ code and inclusion of new methods into sdcmicro
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Minimally infrequent itemset mining using pattern-growth paradigm and residual trees
Proceedings of the 17th International Conference on Management of Data
| Hi-index | 0.00 |
We present SUDA2, a recursive algorithm for finding Minimal Sample Uniques (MSUs). SUDA2 uses a novel method for representing the search space forMSUs and new observations about the properties ofMSUs to prune and traverse this space. Experimental comparisons with previous work demonstrate that SUDA2 is not only several orders of magnitude faster but is also capable of identifying the boundaries of the search space, enabling datasets of larger numbers of columns than before to be addressed.