| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Toon Calders Andy Zaidman , Toon Calders, Serge Demeyer , Jan Paredaens : Applying Webmining Techniques to Execution Traces to Support the Program Comprehension Process. CSMR 2005 : 134-142 Toon Calders: Deducing Bounds on the Support of Itemsets. Database Support for Data Mining Applications 2004 : 214-233 Nele Dexters , Toon Calders: Theoretical Bounds on the Size of Condensed Representations. KDID 2004 : 46-65 Toon Calders: Computational Complexity of Itemset Frequency Satisfiability. PODS 2004 : 143-154 Toon Calders, Bart Goethals : Minimal k -Free Representations of Frequent Sets. PKDD 2003 : 71-82 Toon Calders, Jan Paredaens : Axiomatization of frequent itemsets. Theor. Comput. Sci. 290 (1): 669-693 (2003) Toon Calders, Bart Goethals : Mining All Non-derivable Frequent Itemsets. PKDD 2002 : 74-85 Toon Calders, Raymond T. Ng , Jef Wijsen : Searching for dependencies at multiple abstraction levels. ACM Trans. Database Syst. 27 (3): 229-260 (2002) Toon Calders, Bart Goethals : Mining All Non-Derivable Frequent Itemsets CoRR cs.DB/0206004 : (2002) Toon Calders, Jef Wijsen : On Monotone Data Mining Languages. DBPL 2001 : 119-132 Toon Calders, Jan Paredaens : Axiomatization of Frequent Sets. ICDT 2001 : 204-218 Toon Calders, Jan Paredaens : Mining Frequent Binary Expressions. DaWaK 2000 : 399-408 Jef Wijsen , Raymond T. Ng , Toon Calders: Discovering Roll-Up Dependencies. KDD 1999 : 213-222 1 [ 13 ] 2 [ 11 ] 3 [ 5 ] [ 7 ] [ 9 ] 4 [ 1 ] [ 6 ] 5 [ 2 ] [ 3 ] [ 8 ] [ 13 ] 6 [ 1 ] [ 4 ] [ 6 ] 7 [ 13 ]  ©2005 Association for Computing Machinery |
