156 search results - page 10 / 32 » Mining Frequent Itemsets from Secondary Memory |
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
ADC
2008
Springer
14 years 1 months ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
FSKD
2005
Springer
14 years 28 days ago
2005
Springer
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
FIMI
2003
13 years 8 months ago
2003
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...