• English
    • العربية
  • العربية
  • Login
  • QU
  • QU Library
  •  Home
  • Communities & Collections
  • Help
    • Item Submission
    • Publisher policies
    • User guides
    • FAQs
  • About QSpace
    • Vision & Mission
View Item 
  •   Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  • Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  •      
  •  
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An optimizing and differentially private clustering algorithm for mixed data in SDN-based smart grid

    Thumbnail
    View/Open
    An_Optimizing_and_Differentially_Private_Clustering_Algorithm_for_Mixed_Data_in_SDN-Based_Smart_Grid.pdf (10.84Mb)
    Date
    2019
    Author
    Lv, Zefang
    Wang, Lirong
    Guan, Zhitao
    Wu, Jun
    Du, Xiaojiang
    Zhao, Hongtao
    Guizani, Mohsen
    ...show more authors ...show less authors
    Metadata
    Show full item record
    Abstract
    Software-defined network (SDN) is widely used in smart grid for monitoring and managing the communication network. Big data analytics for SDN-based smart grid has got increasing attention. It is a promising approach to use machine learning technologies to analyze a large amount of data generated in SDN-based smart grid. However, the disclosure of personal privacy information must receive considerable attention. For instance, data clustering in user electricity behavior analysis may lead to the disclosure of personal privacy information. In this paper, an optimizing and differentially private clustering algorithm named ODPCA is proposed. In the ODPCA, the differentially private K-means algorithm and K-modes algorithm are combined to cluster mixed data in a privacy-preserving manner. The allocation of privacy budgets is optimized to improve the accuracy of clustering results. Specifically, the loss function that considers both the numerical and categorical attributes between true centroids and noisy centroids is analyzed to optimize the allocation the privacy budget; the number of iterations of clustering is set to a fixed value based on the total privacy budget and the minimal privacy budget allocated to each iteration. It is proved that the ODPCA can meet the differential privacy requirements and has better performance by comparing with other popular algorithms. 2013 IEEE.
    DOI/handle
    http://dx.doi.org/10.1109/ACCESS.2019.2909048
    http://hdl.handle.net/10576/36121
    Collections
    • Computer Science & Engineering [‎2428‎ items ]

    entitlement


    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Home

    Submit your QU affiliated work

    Browse

    All of Digital Hub
      Communities & Collections Publication Date Author Title Subject Type Language Publisher
    This Collection
      Publication Date Author Title Subject Type Language Publisher

    My Account

    Login

    Statistics

    View Usage Statistics

    About QSpace

    Vision & Mission

    Help

    Item Submission Publisher policiesUser guides FAQs

    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Video