Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Information Loss
Privacy Preserving Data Mining
Satisfiability
Transaction Data
Subscribe
Academic
Publications
PCTA: privacy-constrained clustering-based transaction data anonymization
PCTA: privacy-constrained clustering-based transaction data anonymization,10.1145/1971690.1971695,Aris Gkoulalas-Divanis,Grigorios Loukides
Edit
PCTA: privacy-constrained clustering-based transaction data anonymization
BibTex
|
RIS
|
RefWorks
Download
Aris Gkoulalas-Divanis
,
Grigorios Loukides
Transaction data
about individuals are increasingly collected to support a plethora of applications, spanning from marketing to biomedical studies. Publishing these data is required by many organizations, but may result in privacy breaches, if an attacker exploits potentially identifying information to link individuals to their records in the published data. Algorithms that prevent this threat by transforming
transaction data
prior to their release have been proposed recently, but incur significant
information loss
due to their inability to accommodate a range of different privacy requirements that data owners often have. To address this issue, we propose a novel clustering-based framework to anonymizing transaction data. Our framework provides the basis for designing algorithms that explore a larger solution space than existing methods, which allows publishing data with less information loss, and can satisfy a wide range of privacy requirements. Based on this framework, we develop PCTA, a generalization-based algorithm to construct anonymizations that incur a small amount of
information loss
under many different privacy requirements. Experiments with benchmark datasets verify that PCTA significantly outperforms the current state-of-the-art algorithms in terms of data utility, while being comparable in terms of efficiency.
Published in 2011.
DOI:
10.1145/1971690.1971695
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dl.acm.org
)
(
portal.acm.org
)
(
portal.acm.org
)
References
(33)
Data Privacy through Optimal k-Anonymization
(
Citations: 362
)
Roberto J. Bayardo Jr.
,
Rakesh Agrawal
Conference:
International Conference on Data Engineering - ICDE
, pp. 217-228, 2005
EFFICIENT K-ANONYMITY USING CLUSTERING TECHNIQUE
(
Citations: 14
)
Ji-Won Byun
,
Ashish Kamra
,
Elisa Bertino
,
Ninghui Li
Conference:
Database Systems for Advanced Applications - DASFAA
Towards publishing recommendation data with predictive anonymization
(
Citations: 1
)
Chih-Cheng Chang
,
Brian Thompson
,
Danfeng Yao
Conference:
ACM Conference on Computer and Communications Security - CCS
, pp. 24-35, 2010
Privacy-Preserving Data Publishing
(
Citations: 11
)
Bee-chung Chen
,
Daniel Kifer
,
Kristen Lefevre
,
Ashwin Machanavajjhala
Journal:
Foundations and Trends in Databases - FTDB
, vol. 2, no. 1-2, pp. 1-167, 2009
Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation
(
Citations: 110
)
Josep Domingo-ferrer
,
Vicenç Torra
Journal:
Data Mining and Knowledge Discovery - DATAMINE
, vol. 11, no. 2, pp. 195-212, 2005