Genetic algorithm-based clustering approach for k-anonymization

被引:26
|
作者
Lin, Jun-Lin [1 ]
Wei, Meng-Cheng [1 ]
机构
[1] Yuan Ze Univ, Dept Informat Management, Chungli 320, Taiwan
关键词
k-Anonymity; Clustering; Genetic algorithm;
D O I
10.1016/j.eswa.2009.02.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
k-Anonymity has been widely adopted as a model for protecting public released microdata from individual identification. This model requires that each record must be identical to at least k - 1 other records in the anonymized dataset with respect to a set of privacy-related attributes. Although anonymizing the original dataset to satisfy the requirement of k-anonymity is easy, the anonymized dataset must preserve as much information as possible of the original dataset. Clustering techniques have recently been successfully adapted for k-anonymization. This work proposes a novel genetic algorithm-based clustering approach for k-anonymization. The proposed approach adopts various heuristics to select genes for crossover operations. Experimental results show that this approach can further reduce the information loss caused by traditional clustering-based k-anonymization techniques. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:9784 / 9792
页数:9
相关论文
共 50 条
  • [1] A weighted K-member clustering algorithm for K-anonymization
    Yan, Yan
    Herman, Eyeleko Anselme
    Mahmood, Adnan
    Feng, Tao
    Xie, Pengshou
    COMPUTING, 2021, 103 (10) : 2251 - 2273
  • [2] A weighted K-member clustering algorithm for K-anonymization
    Yan Yan
    Eyeleko Anselme Herman
    Adnan Mahmood
    Tao Feng
    Pengshou Xie
    Computing, 2021, 103 : 2251 - 2273
  • [3] Efficient systematic clustering method for k-anonymization
    Kabir, Md. Enamul
    Wang, Hua
    Bertino, Elisa
    ACTA INFORMATICA, 2011, 48 (01) : 51 - 66
  • [4] Efficient systematic clustering method for k-anonymization
    Md. Enamul Kabir
    Hua Wang
    Elisa Bertino
    Acta Informatica, 2011, 48 : 51 - 66
  • [5] Efficient k-anonymization using clustering techniques
    Byun, Ji-Won
    Kamra, Ashish
    Bertino, Elisa
    Li, Ninghui
    ADVANCES IN DATABASES: CONCEPTS, SYSTEMS AND APPLICATIONS, 2007, 4443 : 188 - +
  • [6] An efficient generalized clustering method for achieving k-anonymization
    Xu, Xiaoshuang
    Numao, Masayuki
    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2015, : 499 - 502
  • [7] A Hybrid Method For K-Anonymization Using Clustering Technique
    Abd Rahim, Yahaya
    Sahib, Shahrin
    Abd Ghani, Mohd Khanapi
    Yaacob, AsrulHadi
    2011 INTERNATIONAL CONFERENCE ON AEROSPACE ENGINEERING AND INFORMATION TECHNOLOGY (AEIT 2011), 2011, : 17 - 20
  • [8] Efficient k-Anonymization through Constrained Collaborative Clustering
    Zouinina, Sarah
    Grozavu, Nistor
    Bennani, Younes
    Lyhyaoui, Abdelouahid
    Rogovschi, Nicoleta
    2018 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2018, : 405 - 411
  • [9] An efficient local-recoding k-anonymization algorithm based on clusterin
    Zhejiang Industry Polytechnic College, Shaoxing
    321000, China
    Lect. Notes Comput. Sci., (253-263):
  • [10] Balanced k-Anonymization
    Al-Fedaghi, Sabah S.
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 6, 2005, : 179 - 182