Sciweavers

288 search results - page 10 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
JCST
2008
119views more  JCST 2008»
15 years 6 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
DKE
2007
119views more  DKE 2007»
15 years 6 months ago
Association rules mining using heavy itemsets
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
Girish Keshav Palshikar, Mandar S. Kale, Manoj M. ...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 11 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
15 years 11 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...
DEXA
2004
Springer
153views Database» more  DEXA 2004»
15 years 11 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith