Sciweavers

313 search results - page 26 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
CLA
2007
14 years 11 months ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...
SAC
2006
ACM
15 years 3 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 1 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
DKE
2008
124views more  DKE 2008»
14 years 9 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
PAKDD
2010
ACM
171views Data Mining» more  PAKDD 2010»
14 years 8 months ago
Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
Yoann Pitarch, Anne Laurent, Pascal Poncelet