Using K-Means Clustering Algorithm for Handling Data Precision

被引:0
|
作者
Suganthi, P. [1 ]
Kala, K. [1 ]
Balasubramanian, C. [2 ]
机构
[1] PSR Rengasamy Coll Engn Women, Dept CSE, Sivakasi, Tamil Nadu, India
[2] PSR Rengasamy Coll Engn Women, CSE, Sivakasi, Tamil Nadu, India
关键词
Privacy preserving; Anonymized Table; Clustering; AES encryption algorithm;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The sensitive data are patient record details, organization record which are handled only administrative member. Preservation of privacy is a major feature of data mining and individual's privacy without losing of confidential data. The objective of privacy preserving data mining is to mine significant information from large amounts of dataset. To prevent the misuse of sensitive information such as patient record by the system administrator. The database administrator collects patient's data which are maintained in secured manner. The sensitive information has patient's name, Address, Disease, Date of Visit. The privacy preservation mechanism can be carried out through anonymization techniques. In order to preserve the sensitive data, the system administrator modifying the patient details. Privacy preserving techniques used to handle the sensitive information from unsanctioned users. The proposal system is original patient record should be transformed into Anonymized table which is identified only by administrative. To keep anonymized table in cluster form using k-means clustering algorithm. To keep anonymized table in cluster form using k-means clustering algorithm. To partition anonymized table into cluster, and each cluster has similar data object which is based on anonymized data attribute. After that the grouped similar data to be protected using AES encryption algorithm. The aim of this paper is to provide more accuracy and better level of privacy of sensitive attribute.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] The Border K-Means Clustering Algorithm for One Dimensional Data
    Froese, Ryan
    Klassen, James W.
    Leung, Carson K.
    Loewen, Tyler S.
    2022 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (IEEE BIGCOMP 2022), 2022, : 35 - 42
  • [42] Canopy with k-means Clustering Algorithm for Big Data Analytics
    Sagheer, Noor S.
    Yousif, Suhad A.
    FOURTH INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2020), 2021, 2334
  • [43] K-MEANS plus : A DEVELOPED CLUSTERING ALGORITHM FOR BIG DATA
    Niu, Kun
    Gao, Zhipeng
    Jiao, Haizhen
    Deng, Nanjie
    PROCEEDINGS OF 2016 4TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS (IEEE CCIS 2016), 2016, : 141 - 144
  • [44] An evolutionary K-means algorithm for clustering time series data
    Zhang, H
    Ho, TB
    Lin, MS
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1282 - 1287
  • [45] Modified k-Means Clustering Algorithm
    Patel, Vaishali R.
    Mehta, Rupa G.
    COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY, 2011, 250 : 307 - +
  • [46] Modified K-means clustering algorithm
    Li, Wei
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 4, PROCEEDINGS, 2008, : 618 - 621
  • [47] The MinMax k-Means clustering algorithm
    Tzortzis, Grigorios
    Likas, Aristidis
    PATTERN RECOGNITION, 2014, 47 (07) : 2505 - 2516
  • [48] The global k-means clustering algorithm
    Likas, A
    Vlassis, N
    Verbeek, JJ
    PATTERN RECOGNITION, 2003, 36 (02) : 451 - 461
  • [49] Improved K-means clustering algorithm
    Zhang, Zhe
    Zhang, Junxi
    Xue, Huifeng
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 5, PROCEEDINGS, 2008, : 169 - 172
  • [50] A k-means based clustering algorithm
    Bloisi, Domenico Daniele
    Locchi, Luca
    COMPUTER VISION SYSTEMS, PROCEEDINGS, 2008, 5008 : 109 - 118