Multi-Sorted Inverse Frequent Itemsets Mining: On-Going Research
暂无分享,去创建一个
[1] Toon Calders. Computational complexity of itemset frequency satisfiability , 2004, PODS '04.
[2] Domenico Saccà,et al. Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs , 2013, TKDD.
[3] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2002, Journal of Cryptology.
[4] Dimitrios Gunopulos,et al. Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.
[5] Keith W. Miller,et al. Big Data: New Opportunities and New Challenges [Guest editors' introduction] , 2013, Computer.
[6] Bart Goethals,et al. Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.
[7] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[8] Domenico Saccà,et al. An Effective Approach to Inverse Frequent Set Mining , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[9] D. Griffel. Linear programming 2: Theory and extensions , by G. B. Dantzig and M. N. Thapa. Pp. 408. £50.00. 2003 ISBN 0 387 00834 9 (Springer). , 2004, The Mathematical Gazette.
[10] Jiawei Han,et al. Frequent pattern mining: current status and future directions , 2007, Data Mining and Knowledge Discovery.
[11] Toon Calders. The complexity of satisfying constraints on databases of transactions , 2007, Acta Informatica.
[12] Taneli Mielikäinen,et al. On Inverse Frequent Set Mining , 2003 .