148 search results - page 5 / 30 » Frequent Itemsets Mining for Database Auto-Administration |
CIKM
2006
Springer
14 years 5 days ago
2006
Springer
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
CINQ
2004
Springer
14 years 5 days 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...
ICTAI
2003
IEEE
14 years 1 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...
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
FIMI
2003
13 years 9 months ago
2003
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...