Sciweavers

12 search results - page 1 / 3
» Private Itemset Support Counting
Sort
View
ICICS
2005
Springer
13 years 10 months ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
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
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 6 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 5 months ago
Dense itemsets
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...
Heikki Mannila, Jouni K. Seppänen
CINQ
2004
Springer
125views Database» more  CINQ 2004»
13 years 10 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders