296 search results - page 22 / 60 » Privacy-preserving algorithms for distributed mining of freq... |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
IDA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
ADC
2006
Springer
14 years 3 months ago
2006
Springer
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
FIMI
2003
13 years 10 months ago
2003
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...