首页    期刊浏览 2025年06月21日 星期六
登录注册

文章基本信息

  • 标题:C-mixture and multi-constraints based genetic algorithm for collaborative data publishing
  • 本地全文:下载
  • 作者:Yogesh R. Kulkarni ; T. Senthil Murugan
  • 期刊名称:Journal of King Saud University @?C Computer and Information Sciences
  • 印刷版ISSN:1319-1578
  • 出版年度:2018
  • 卷号:30
  • 期号:2
  • 页码:175-184
  • DOI:10.1016/j.jksuci.2016.06.001
  • 出版社:Elsevier
  • 摘要:

    Due to increasing need of using distributed databases, high demand presents on sharing data to easily update and access the useful information without any interruption. The sharing of distributed databases causes a serious issue of securing information since the databases consist of sensitive personal information. To preserve the sensitive information and at the same time, releasing the useful information, a significant effort is made by the researchers under privacy preserving data publishing that have been receiving considerable attention in recent years. In this work, a new privacy measure, called c-mixture is introduced to maintain the privacy constraint without affecting utility of the database. In order to apply the proposed privacy measure to privacy preserving data publishing, a new algorithm called, CPGEN is developed using genetic algorithm and multi-objective constraints. The proposed multi-objective optimization considered the multiple privacy constraints along with the utility measurement to measure the importance. Also, the proposed CPGEN is adapted to handle the cold-start problem which commonly happened in distributed databases. The proposed algorithm is experimented with adult dataset and quantitative performance is analyzed using generalized information loss and average equivalence class size metric. From the experimentation, we proved that the proposed algorithm maintained the privacy and utility as compared with the existing algorithm.

  • 关键词:Privacy ; Utility ; Distributed databases ; Data publishing ; Optimization ; Sensitive information
国家哲学社会科学文献中心版权所有