Online Social Networks (OSN) sites allow end-users to share agreat deal of information, which may also contain sensitive information,that may be subject to commercial or non-commercial privacy attacks. Asa result, gua...Online Social Networks (OSN) sites allow end-users to share agreat deal of information, which may also contain sensitive information,that may be subject to commercial or non-commercial privacy attacks. Asa result, guaranteeing various levels of privacy is critical while publishingdata by OSNs. The clustering-based solutions proved an effective mechanismto achieve the privacy notions in OSNs. But fixed clustering limits theperformance and scalability. Data utility degrades with increased privacy,so balancing the privacy utility trade-off is an open research issue. Theresearch has proposed a novel privacy preservation model using the enhancedclustering mechanism to overcome this issue. The proposed model includesphases like pre-processing, enhanced clustering, and ensuring privacy preservation.The enhanced clustering algorithm is the second phase where authorsmodified the existing fixed k-means clustering using the threshold approach.The threshold value is determined based on the supplied OSN data of edges,nodes, and user attributes. Clusters are k-anonymized with multiple graphproperties by a novel one-pass algorithm. After achieving the k-anonymityof clusters, optimization was performed to achieve all privacy models, suchas k-anonymity, t-closeness, and l-diversity. The proposed privacy frameworkachieves privacy of all three network components, i.e., link, node, and userattributes, with improved utility. The authors compare the proposed techniqueto underlying methods using OSN Yelp and Facebook datasets. The proposedapproach outperformed the underlying state of art methods for Degree ofAnonymization, computational efficiency, and information loss.展开更多
Data publishing is an area of interest in present day technology that has gained huge attention of researchers and experts.The concept of data publishing faces a lot of security issues,indicating that when any trusted...Data publishing is an area of interest in present day technology that has gained huge attention of researchers and experts.The concept of data publishing faces a lot of security issues,indicating that when any trusted organization provides data to a third party,personal information need not be disclosed.Therefore,to maintain the privacy of the data,this paper proposes an algorithm for privacy preserved collaborative data publishing using the Genetic Grey Wolf Optimizer(Genetic GWO)algorithm for which a C-mixture parameter is used.The C-mixture parameter enhances the privacy of the data if the data does not satisfy the privacy constraints,such as the k-anonymity,l-diversity and the m-privacy.A minimum fitness value is maintained that depends on the minimum value of the generalized information loss and the minimum value of the average equivalence class size.The minimum value of the fitness ensures the maximum utility and the maximum privacy.Experimentation was carried out using the adult dataset,and the proposed Genetic GWO outperformed the existing methods in terms of the generalized information loss and the average equivalence class metric and achieved minimum values at a rate of 0.402 and 0.9,respectively.展开更多
文摘Online Social Networks (OSN) sites allow end-users to share agreat deal of information, which may also contain sensitive information,that may be subject to commercial or non-commercial privacy attacks. Asa result, guaranteeing various levels of privacy is critical while publishingdata by OSNs. The clustering-based solutions proved an effective mechanismto achieve the privacy notions in OSNs. But fixed clustering limits theperformance and scalability. Data utility degrades with increased privacy,so balancing the privacy utility trade-off is an open research issue. Theresearch has proposed a novel privacy preservation model using the enhancedclustering mechanism to overcome this issue. The proposed model includesphases like pre-processing, enhanced clustering, and ensuring privacy preservation.The enhanced clustering algorithm is the second phase where authorsmodified the existing fixed k-means clustering using the threshold approach.The threshold value is determined based on the supplied OSN data of edges,nodes, and user attributes. Clusters are k-anonymized with multiple graphproperties by a novel one-pass algorithm. After achieving the k-anonymityof clusters, optimization was performed to achieve all privacy models, suchas k-anonymity, t-closeness, and l-diversity. The proposed privacy frameworkachieves privacy of all three network components, i.e., link, node, and userattributes, with improved utility. The authors compare the proposed techniqueto underlying methods using OSN Yelp and Facebook datasets. The proposedapproach outperformed the underlying state of art methods for Degree ofAnonymization, computational efficiency, and information loss.
文摘Data publishing is an area of interest in present day technology that has gained huge attention of researchers and experts.The concept of data publishing faces a lot of security issues,indicating that when any trusted organization provides data to a third party,personal information need not be disclosed.Therefore,to maintain the privacy of the data,this paper proposes an algorithm for privacy preserved collaborative data publishing using the Genetic Grey Wolf Optimizer(Genetic GWO)algorithm for which a C-mixture parameter is used.The C-mixture parameter enhances the privacy of the data if the data does not satisfy the privacy constraints,such as the k-anonymity,l-diversity and the m-privacy.A minimum fitness value is maintained that depends on the minimum value of the generalized information loss and the minimum value of the average equivalence class size.The minimum value of the fitness ensures the maximum utility and the maximum privacy.Experimentation was carried out using the adult dataset,and the proposed Genetic GWO outperformed the existing methods in terms of the generalized information loss and the average equivalence class metric and achieved minimum values at a rate of 0.402 and 0.9,respectively.
