28 search results - page 2 / 6 » Efficient Incremental Mining of Top-K Frequent Closed Itemse... |
FIMI
2004
13 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
FIMI
2004
13 years 6 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
ADMA
2006
Springer
13 years 8 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...
DKE
2008
13 years 4 months ago
2008
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
DAWAK
2010
Springer
13 years 6 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...