Multi-Objective Optimization of K in K-anonymity Model

来源 :2014全国理论计算机科学学术年会 | 被引量 : 0次 | 上传用户:tiantian200510
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  K-anonymity privacy model is a typical model to protect privacy when disseminating data involving individual subjects.The drawback of k-anonymity is that generalization will result in considerable loss of information.Further,under limited information loss an exhaustive analysis is required to determine a k value based on the privacy requirement by data publisher.Studies in this context have so far focused on minimizing the information loss for some given value of k,how to optimize k value that fits the specified data quality and privacy requirement is sparse.In this paper,we formulate a multi-objective optimization problem of k to illustrate that the decision of k can be much more exible.At first,one k bound is analyzed basing on the privacy disclosure,and another k bound is analyzed basing on the data quality metric.Then,the optimal k-value is gained by intersecting the two bounds.At last,an algorithm is employed to provide multi-objective optimization of k that is win-win on privacy requirement and data quality.
其他文献
To further explore the up-to techniques for bisimulation in the coalgebra setting,we investigate a special kind of functor,i.e.,product functor in this paper.Specifically,when F is the product of n su
Motivated by a previous work showing a new NP-complete decision problem,the Multistage graph Simple Path problem (MSP) possesses a novel polynomial-time heuristic algorithm,which has undergone extensi
Spatio-Temporal properties are the intrinsic properties of Cyber-Physical System(CPS),the correlation in space and time between computing and physical entities should be fully considered in CPS modeli
With the rapid development of cloud computing,how to effectively improve the utilization of computing resources in a cloud becomes a difficult problem.Therefore,a large number of distributed and paral
Considering poor quality and high noise in medical data,we propose an ensemble classifier based on support vector machine (SVM) and apply this classifier to health identification.Health identification
An L(2,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices get numbers at least two apart,and vertices at distance two get distinct numbe
We investigate the unbalanced cut problems.A cut (A;B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called Ek-size),where k is an input parameter.An
会议
To solve the security problems in single-cloud storage,multi-cloud storage system has been put forward in some literatures.However,when using multi-cloud,a user needs to be authenticated by different
It is crucial for synonym substitution-based steganographic algorithms to choose a suitable coding strategy for high embedding capacity.In this paper,three existing coding strategies are discussed in
Three-dimensional image registration of CT and MRI of human knees facilitates the construction of high-quality models providing the features of both modalities.This multi-modal image registration prob