1. Bonchi F, Lucchese C (2006) On condensed representations of constrained frequent patterns. Knowl Inf Syst 9: 180–201
2. Borgelt C (2004) Recursion pruning for the apriori algorithm. In: Bayardo RJ Jr, Goethals B, Zaki MJ (eds) FIMI’04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004. CEUR Worshop Proceedings, CEUR-WS.org, vol 126
3. Boulicaut J-F, Jeudy B (2001) Mining free itemsets under constraints. In: Adiba ME, Collet C, Desai BC (eds) IDEAS, pp 322–329
4. Bringmann B, Zimmermann A (2005) Tree2—decision trees for tree structured data. In: Jorge A, Torgo L, Brazdil P, Camacho R, Gama J(eds) PKDD. Springer, Berlin, pp 46–58
5. Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Elomaa T, Mannila H, Toivonen H(eds) PKDD. Springer, Berlin, pp 74–85