Mining association rules between sets of items in large databases, ACM SIGMOD Record, vol.22, issue.2, pp.207-216, 1993. ,
DOI : 10.1145/170036.170072
Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1996. ,
DOI : 10.1287/opre.46.3.316
URL : http://www.isye.gatech.edu/research/files/lec9403.pdf
Max-sum diversification, monotone submodular functions and dynamic updates, Proceedings of the 31st Symposium on Principles of Database Systems. pp. 155?166. PODS '12, 2012. ,
DOI : 10.1145/2213556.2213580
URL : http://www.cs.toronto.edu/~bor/pods-arXiv-version.pdf
Itemset frequency satisfiability: Complexity and axiomatization, Theoretical Computer Science, vol.394, issue.1-2, pp.84-111, 2008. ,
DOI : 10.1016/j.tcs.2007.11.003
URL : https://doi.org/10.1016/j.tcs.2007.11.003
Fimi03: Workshop on frequent itemset mining implementations, Third IEEE International Conference on Data Mining Workshop on Frequent Itemset Mining Implementations, pp.1-13, 2003. ,
DOI : 10.1145/1007730.1007744
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs, ACM Transactions on Knowledge Discovery from Data, vol.7, issue.4, 2013. ,
DOI : 10.1145/2541268.2541271
An Effective Approach to Inverse Frequent Set Mining, 2009 Ninth IEEE International Conference on Data Mining, pp.806-811, 2009. ,
DOI : 10.1109/ICDM.2009.123
-diversity, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, p.3, 2007. ,
DOI : 10.1145/1217299.1217302
On inverse frequent set mining, Proc. of 2nd Workshop on Privacy Preserving Data Mining (PPDM), pp.18-23, 2003. ,
Feasible itemeset distributions in data mining: theory and application, Proc. 28th International Conference on Very Large Data Bases, pp.682-693, 2002. ,
DOI : 10.1145/773153.773181
URL : http://www.cs.rpi.edu/~zaki/./PS/PODS03.pdf
Protecting respondents identities in microdata release. Knowledge and Data Engineering, IEEE Transactions on, vol.13, issue.6, pp.1010-1027, 2001. ,
DOI : 10.1109/69.971193
Theory of Linear and Integer Programming, 1986. ,
Approximate inverse frequent itemset mining: Privacy, complexity , and approximation, pp.482-489, 2005. ,
Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining, Proc. 5th SIAM International Conference on Data Mining, 2005. ,
DOI : 10.1137/1.9781611972757.10
URL : http://www.siam.org/proceedings/datamining/2005/dm05_10WuX.pdf