Sciweavers

148 search results - page 16 / 30
» Frequent Itemsets Mining for Database Auto-Administration
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
SAC
2006
ACM
14 years 2 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
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 10 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 8 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
CAEPIA
2003
Springer
14 years 1 months ago
Text Mining Using the Hierarchical Syntactical Structure of Documents
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
Roxana Dánger, José Ruiz-Shulcloper,...