295 search results - page 5 / 59 » Frequent regular itemset mining |
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
ICTAI
2003
IEEE
14 years 28 days ago
2003
IEEE
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...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
