388 search results - page 5 / 78 » Mining Frequent Itemsets Using Support Constraints |
ADMA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
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. ...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...