Sciweavers

81 search results - page 2 / 17
» Feasible itemset distributions in data mining: theory and ap...
Sort
View
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 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
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 5 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
HIPC
2003
Springer
13 years 10 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
PPOPP
2005
ACM
13 years 11 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...