165 search results - page 4 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
ADBIS
1998
Springer
13 years 12 months ago
1998
Springer
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
PAKDD
2007
ACM
14 years 1 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. ...
ICTAI
2003
IEEE
14 years 27 days 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...
CIKM
2009
Springer
14 years 7 days ago
2009
Springer
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
— Association Rule Mining is a thoroughly studied problem in Data Mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the...