1998 search results - page 326 / 400 » Basic Association Rules |
ICTAI
2003
IEEE
14 years 3 months 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...
SBACPAD
2003
IEEE
14 years 3 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
APWEB
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We present WBext (Web Browser extended), a web browser extended with client-side mining capabilities. WBext learns sophisticated user interests and browsing habits by tai...
AUSAI
2003
Springer
14 years 3 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
DIS
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...