Sciweavers

573 search results - page 18 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 9 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
JIIS
2007
150views more  JIIS 2007»
13 years 7 months ago
Towards a new approach for mining frequent itemsets on data stream
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
Chedy Raïssi, Pascal Poncelet, Maguelonne Tei...
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
14 years 1 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...
SDM
2004
SIAM
271views Data Mining» more  SDM 2004»
13 years 9 months ago
A Foundational Approach to Mining Itemset Utilities from Databases
Most approaches to mining association rules implicitly consider the utilities of the itemsets to be equal. We assume that the utilities of itemsets may differ, and identify the hi...
Hong Yao, Howard J. Hamilton, Cory J. Butz