Theoretical Bounds on the Size of Condensed Representations.
Nele Dexters, Toon Calders: Theoretical Bounds on the Size of Condensed Representations. KDID 2004: 46-65
View ArticleA probability analysis for candidate-based frequent itemset algorithms.
Nele Dexters, Paul W. Purdom, Dirk Van Gucht: A probability analysis for candidate-based frequent itemset algorithms. SAC 2006: 541-545
View ArticlePeak-Jumping Frequent Itemset Mining Algorithms.
Nele Dexters, Paul W. Purdom, Dirk Van Gucht: Peak-Jumping Frequent Itemset Mining Algorithms. PKDD 2006: 487-494
View ArticleMining Frequent Itemsets in a Stream.
Toon Calders, Nele Dexters, Bart Goethals: Mining Frequent Itemsets in a Stream. ICDM 2007: 83-92
View ArticleA new support measure for items in streams.
Toon Calders, Nele Dexters, Bart Goethals: A new support measure for items in streams. Monde des Util. Anal. Données 36: 37-41 (2007)
View ArticleMining frequent items in a stream using flexible windows.
Toon Calders, Nele Dexters, Bart Goethals: Mining frequent items in a stream using flexible windows. Intell. Data Anal. 12(3): 293-304 (2008)
View ArticleMining frequent itemsets in a stream.
Toon Calders, Nele Dexters, Joris J. M. Gillis, Bart Goethals: Mining frequent itemsets in a stream. Inf. Syst. 39: 233-255 (2014)
View Article
More Pages to Explore .....