Sciweavers

94 search results - page 2 / 19
» Efficient Frequent Itemsets Mining by Sampling
Sort
View
ADMA
2006
Springer
137views Data Mining» more  ADMA 2006»
13 years 8 months ago
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
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...
Jinlong Wang, Congfu Xu, Hongwei Dan, Yunhe Pan
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 6 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
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 ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
DIS
2007
Springer
13 years 8 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin
KAIS
2006
164views more  KAIS 2006»
13 years 4 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
APWEB
2005
Springer
13 years 10 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang