295 search results - page 24 / 59 » Frequent regular itemset mining |
205
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
CLA
2007
15 years 1 months ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
120
click to vote
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
120
click to vote
DKE
2008
14 years 12 months ago
2008
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...