Sciweavers

EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 7 months ago
An efficient clustering method for k-anonymization
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
Jun-Lin Lin, Meng-Cheng Wei
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 7 months ago
Micro-aggregation-based heuristics for p-sensitive k-anonymity: one step beyond
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
Agusti Solanas, Francesc Sebé, Josep Doming...
EDBT
2008
ACM
172views Database» more  EDBT 2008»
14 years 7 months ago
Distributed privacy preserving k-means clustering with additive secret sharing
Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the curr...
Albert Levi, Erkay Savas, Mahir Can Doganay, Thoma...
EDBT
2008
ACM
129views Database» more  EDBT 2008»
14 years 7 months ago
Design of PriServ, a privacy service for DHTs
By decentralizing control, P2P systems provide efficient, scalable data sharing. However, when sharing data for different purposes (e.g., billing, purchase, shipping, etc.), data ...
Mohamed Jawad, Patricia Serrano-Alvarado, Patrick ...
EDBT
2008
ACM
144views Database» more  EDBT 2008»
14 years 7 months ago
Protecting privacy in recorded conversations
Professionals in the field of speech technology are often constrained by a lack of speech corpora that are important to their research and development activities. These corpora ex...
Scot Cunningham, Traian Marius Truta
EDBT
2008
ACM
146views Database» more  EDBT 2008»
14 years 7 months ago
Attribute selection in multivariate microaggregation
Microaggregation is one of the most employed microdata protection methods. The idea is to build clusters of at least k original records, and then replace them with the centroid of...
Javier Herranz, Jordi Nin, Vicenç Torra
EDBT
2008
ACM
136views Database» more  EDBT 2008»
14 years 7 months ago
Data challenges at Yahoo!
Ricardo A. Baeza-Yates, Raghu Ramakrishnan
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 7 months ago
On-line discovery of hot motion paths
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...
Dimitris Sacharidis, Kostas Patroumpas, Manolis Te...
EDBT
2008
ACM
151views Database» more  EDBT 2008»
14 years 7 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 7 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki