352 search results - page 6 / 71 » Non-derivable itemset mining |
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...
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...
JCIT
2008
13 years 7 months ago
2008
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
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...
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...