Sciweavers

41 search results - page 4 / 9
» Finding frequent items in probabilistic data
Sort
View
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
13 years 10 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 5 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
ECML
2007
Springer
13 years 8 months ago
Finding Composite Episodes
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
Ronnie Bathoorn, Arno Siebes
APPINF
2003
13 years 6 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 6 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly