ICDM 2007 | Sciweavers

9

ICDM
2007
IEEE

180views Data Mining» more ICDM 2007»

13 years 10 months ago

We study the problem of ﬁnding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is deﬁned as its maximal frequency ove...

Toon Calders, Nele Dexters, Bart Goethals

claim paper

Read More »

13

click to vote

ICDM
2007
IEEE

121views Data Mining» more ICDM 2007»

Finding Predictive Runs with LAPS

13 years 10 months ago

Download www.stat.rutgers.edu

We present an extension to the Lasso [9] for binary classiﬁcation problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...

Suhrid Balakrishnan, David Madigan

claim paper

Read More »

8

click to vote

ICDM
2007
IEEE

127views Data Mining» more ICDM 2007»

Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees

13 years 10 months ago