Database Reference
In-Depth Information
Acknowledgments
Jilles Vreeken is supported by the Cluster of Excellence “Multimodal Comput-
ing and Interaction” within the Excellence Initiative of the German Federal Government. Nikolaj
Tatti is supported by Academy of Finland grant 118653 (ALGODAN).
References
1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In
VLDB
, pages
487-499, 1994.
2. C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In
PODS
, pages 18-24.
ACM, 1998.
3. R. Agrawal, T. Imielinksi, and A. Swami. Mining association rules between sets of items in
large databases. In
SIGMOD
, pages 207-216. ACM, 1993.
4. M. Al Hasan and M. J. Zaki. Output space sampling for graph patterns.
PVLDB
, 2(1):730-741,
2009.
5. M. Al Hasan, V. Chaoji, S. Salem, J. Besson, and M. J. Zaki. Origami: Mining representative
orthogonal graph patterns. In
ICDM
, pages 153-162. IEEE, 2007.
6. R. Bayardo. Efficiently mining long patterns from databases. In
SIGMOD
, pages 85-93, 1998.
7. M. Boley, C. Lucchese, D. Paurat, and T. Gärtner. Direct local pattern sampling by efficient
two-step random procedures. In
KDD
, pages 582-590. ACM, 2011.
8. M. Boley, S. Moens, and T. Gärtner. Linear space direct pattern sampling using coupling from
the past. In
KDD
, pages 69-77. ACM, 2012.
9. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean
data for the approximation of frequency queries.
Data Min. Knowl. Disc.
, 7(1):5-22, 2003.
10. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules
to correlations. In
SIGMOD
, pages 265-276. ACM, 1997.
11. D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. MAFIA: A maximal frequent
itemset algorithm.
IEEE TKDE
, 17(11):1490-1504, 2005.
12. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In
PKDD
, pages 74-85,
2002.
13. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees.
IEEE TIT
, 14(3):462-467, 1968.
14. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang.
Finding interesting associations without support pruning.
IEEE TKDE
, 13(1):64-78, 2001.
15. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic networks and
expert systems. In
Statistics for Engineering and Information Science
. Springer-Verlag, 1999.
16. I. Csiszár. I-divergence geometry of probability distributions and minimization problems.
Annals Prob.
, 3(1):146-158, 1975.
17. T. De Bie. An information theoretic framework for data mining. In
KDD
, pages 564-572.
ACM, 2011.
18. T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in
binary databases.
Data Min. Knowl. Disc.
, 23(3):407-446, 2011.
19. R. A. Fisher. On the interpretation of
χ
2
from contingency tables, and the calculation of P.
J.
R. Statist. Soc.
, 85(1):87-94, 1922.
20. A. Gallo, N. Cristianini, and T. De Bie. MINI: Mining informative non-redundant itemsets. In
ECML PKDD
, pages 438-445. Springer, 2007.
21. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In
DS
, pages 278-289, 2004.
22. A. Gionis, H. Mannila, and J. K. Seppänen. Geometric and combinatorial tiles in 0-1 data. In
PKDD
, pages 173-184. Springer, 2004.
23. A. Gionis, H. Mannila, T. Mielikäinen, and P. Tsaparas. Assessing data mining results via swap
randomization.
TKDD
, 1(3):167-176, 2007.
24. B.
Goethals
and
M.
Zaki.
Frequent
itemset
mining
dataset
repository
(FIMI).
http://fimi.ua.ac.be/, 2004.
