41 search results - page 3 / 9 » Parallel and Distributed Frequent Itemset Mining on Dynamic ... |
IEEEHPCS
2010
13 years 5 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
FIMI
2003
13 years 8 months ago
2003
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...
PPOPP
2005
ACM
14 years 20 days ago
2005
ACM
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...
PODS
2009
ACM
14 years 7 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
IDEAS
2005
IEEE
14 years 21 days ago
2005
IEEE
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...