Sciweavers

259 search results - page 22 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
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
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
15 years 10 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
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
115
Voted
IDA
2002
Springer
14 years 9 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
ICDE
2000
IEEE
118views Database» more  ICDE 2000»
15 years 11 months ago
Mining Recurrent Items in Multimedia with Progressive Resolution Refinement
Despite the overwhelming amounts of multimedia data recently generated and the significance of such data, very few people have systematically investigated multimedia data mining. ...
Hua Zhu, Jiawei Han, Osmar R. Zaïane