51 search results - page 3 / 11 » MAFIA: A Performance Study of Mining Maximal Frequent Itemse... |
JIIS
2010
14 years 4 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
DIS
2007
Springer
15 years 1 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
ADC
2006
Springer
15 years 3 months ago
2006
Springer
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
103
click to vote
DMIN
2007
14 years 11 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...