IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0206832.html
   My bibliography  Save this article

A differential privacy protecting K-means clustering algorithm based on contour coefficients

Author

Listed:
  • Yaling Zhang
  • Na Liu
  • Shangping Wang

Abstract

This paper, based on differential privacy protecting K-means clustering algorithm, realizes privacy protection by adding data-disturbing Laplace noise to cluster center point. In order to solve the problem of Laplace noise randomness which causes the center point to deviate, especially when poor availability of clustering results appears because of small privacy budget parameters, an improved differential privacy protecting K-means clustering algorithm was raised in this paper. The improved algorithm uses the contour coefficients to quantitatively evaluate the clustering effect of each iteration and add different noise to different clusters. In order to be adapted to the huge number of data, this paper provides an algorithm design in MapReduce Framework. Experimental finding shows that the new algorithm improves the availability of the algorithm clustering results under the condition of ensuring individual privacy without significantly increasing its operating time.

Suggested Citation

  • Yaling Zhang & Na Liu & Shangping Wang, 2018. "A differential privacy protecting K-means clustering algorithm based on contour coefficients," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-15, November.
    • Handle: RePEc:plo:pone00:0206832
    DOI: 10.1371/journal.pone.0206832
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0206832
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0206832&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0206832?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yaling Zhang & Jin Han, 2021. "Differential privacy fuzzy C-means clustering algorithm based on gaussian kernel function," PLOS ONE, Public Library of Science, vol. 16(3), pages 1-20, March.
    2. Hossam M J Mustafa & Masri Ayob & Mohd Zakree Ahmad Nazri & Graham Kendall, 2019. "An improved adaptive memetic differential evolution optimization algorithms for data clustering problems," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-28, May.
    3. Sadia Basar & Mushtaq Ali & Gilberto Ochoa-Ruiz & Mahdi Zareei & Abdul Waheed & Awais Adnan, 2020. "Unsupervised color image segmentation: A case of RGB histogram based K-means clustering initialization," PLOS ONE, Public Library of Science, vol. 15(10), pages 1-21, October.
    4. Zhao, Laijun & Li, Deqiang & Guo, Xiaopeng & Xue, Jian & Wang, Chenchen & Sun, Wenjun, 2021. "Cooperation risk of oil and gas resources between China and the countries along the Belt and Road," Energy, Elsevier, vol. 227(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0206832. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.