295 search results - page 4 / 59 » Frequent regular itemset mining |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
FIMI
2004
13 years 9 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
DAWAK
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...