Publishing Time-Series Data under Preservation of Privacy and Distance Orders

Citations

WEB OF SCIENCE

9
Citations

SCOPUS

11

초록

In this paper we address the problem of preserving mining accuracy as well as privacy in publishing sensitive time-series data. For example, people with heart disease do not want to disclose their electrocardiogram time-series, but they still allow mining of some accurate patterns from their time-series. Based on this observation, we introduce the related assumptions and requirements. We show that only randomization methods satisfy all assumptions, but even those methods do not satisfy the requirements. Thus, we discuss the randomization-based solutions that satisfy all assumptions and requirements. For this purpose, we use the noise averaging effect of piecewise aggregate approximation (PAA), which may alleviate the problem of destroying distance orders in randomly perturbed time-series. Based on the noise averaging effect, we first propose two naive solutions that use the random data perturbation in publishing time-series while exploiting the PAA distance in computing distances. There is, however, a tradeoff between these two solutions with respect to uncertainty and distance orders. We thus propose two more advanced solutions that take advantages of both naive solutions. Experimental results show that our advanced solutions are superior to the naive solutions.

키워드

data miningtime-series dataprivacy preservationsimilarity searchdata perturbation
제목
Publishing Time-Series Data under Preservation of Privacy and Distance Orders
저자
Moon, Yang-SaeKim, Hea-SukKim, Sang-PilBertino, Elisa
발행일
2010
유형
Proceedings Paper
저널명
Lecture Notes in Computer Science
6262
페이지
17 ~ +