Sciweavers

4 search results - page 1 / 1
» A MaxMin approach for hiding frequent itemsets
Sort
View
DKE
2008
124views more  DKE 2008»
13 years 6 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
CIKM
2006
Springer
13 years 10 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
DIS
2004
Springer
13 years 11 months ago
Privacy Problems with Anonymized Transaction Databases
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
Taneli Mielikäinen
DSS
2007
226views more  DSS 2007»
13 years 6 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri