Sciweavers

697 search results - page 115 / 140
» Mining negative association rules
Sort
View
FIMI
2004
175views Data Mining» more  FIMI 2004»
15 years 6 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 10 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
ICDM
2007
IEEE
145views Data Mining» more  ICDM 2007»
15 years 11 months ago
Using Data Mining to Estimate Missing Sensor Data
Estimating missing sensor values is an inherent problem in sensor network applications; however, existing data estimation approaches do not apply well to the context of datastream...
Le Gruenwald, Hamed Chok, Mazen Aboukhamis
ICWE
2004
Springer
15 years 10 months ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
ICTAI
2003
IEEE
15 years 9 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo