Fourier Magnitude-Based Privacy-Preserving Clustering on Time-Series Data
スポンサーリンク
概要
- 論文の詳細を見る
Privacy-preserving clustering (PPC in short) is important in publishing sensitive time-series data. Previous PPC solutions, however, have a problem of not preserving distance orders or incurring privacy breach. To solve this problem, we propose a new PPC approach that exploits Fourier magnitudes of time-series. Our magnitude-based method does not cause privacy breach even though its techniques or related parameters are publicly revealed. Using magnitudes only, however, incurs the distance order problem, and we thus present magnitude selection strategies to preserve as many Euclidean distance orders as possible. Through extensive experiments, we showcase the superiority of our magnitude-based approach.
- (社)電子情報通信学会の論文
- 2010-06-01
著者
-
Moon Yang-sae
Department Of Computer Science Kangwon National University
-
Kim Hea-suk
Department Of Computer Science Kangwon National University
関連論文
- Efficient Storage and Querying of Horizontal Tables Using a PIVOT Operation in Commercial Relational DBMSs
- Fourier Magnitude-Based Privacy-Preserving Clustering on Time-Series Data
- Hybrid Lower-Dimensional Transformation for Similar Sequence Matching
- Fast Normalization-Transformed Subsequence Matching in Time-Series Databases(Data Mining)
- A Data Cleansing Method for Clustering Large-Scale Transaction Databases
- Linear Detrending Subsequence Matching in Time-Series Databases
- A Fast Divide-and-Conquer Algorithm for Indexing Human Genome Sequences