Search

Neural network is a supervised classification algorithm which can deal with high complexity and nonlinear data analysis. Supervised algorithm needs some known labels in the training process, and then corrects parameters through backpropagation method. However, due to the lack of marked labels, existing literature mostly uses Auto-Encoder to reduce the dimension of data when facing of clustering problems. This paper proposes an RBF (Radial Basis Function) neural network clustering algorithm based on K-nearest neighbors theory, which first uses K-means algorithm for preclassification, and then constructs self-supervised labels based on K-nearest neighbors theory for backpropagation. The algorithm in this paper belongs to a self-supervised neural network clustering algorithm, and it also makes the neural network truly have the ability of self-decision-making and self-optimization. From the experimental results of the artificial data sets and the UCI data sets, it can be proved that the proposed algorithm has excellent adaptability and robustness. [ABSTRACT FROM AUTHOR]

By learning generative models of semantic-rich data distributions from samples, generative adversarial network (GAN) has recently attracted intensive research interests due to its excellent empirical performance as a generative model. The model is used to estimate the underlying distribution of a dataset and randomly generate realistic samples according to their estimated distribution. However, GANs can easily remember training samples due to the high model complexity of deep networks. When GANs are applied to private or sensitive data, the concentration of distribution may divulge some critical information. It consequently requires new technological advances to mitigate the information leakage under GANs. To address this issue, we propose GANobfuscator, a differentially private GAN, which can achieve differential privacy under GANs by adding carefully designed noise to gradients during the learning procedure. With GANobfuscator, analysts are able to generate an unlimited amount of synthetic data for arbitrary analysis tasks without disclosing the privacy of training data. Moreover, we theoretically prove that GANobfuscator can provide strict privacy guarantee with differential privacy. In addition, we develop a gradient-pruning strategy for GANobfuscator to improve the scalability and stability of data training. Through extensive experimental evaluation on benchmark datasets, we demonstrate that GANobfuscator can produce high-quality generated data and retain desirable utility under practical privacy budgets. [ABSTRACT FROM AUTHOR]

Edge computing has emerged as a promising paradigm for delay-sensitive and context-aware IoT data analytics, through migrating data processing from the cloud to the edge of the network. However, traditional solutions adopting homomorphic encryption to achieve data protection and aggregation at edge servers are infeasible because of their heavy computational overhead. How to preserve data privacy while guaranteeing data utility in edge computing becomes an extremely important problem for IoT data analytics. In this article, we propose a local differential privacy obfuscation (LDPO) framework for IoT data analytics to aggregate and distill the IoT data at the edge without disclosing users' sensitive data. We first introduce the architecture and benefits of the LDPO framework, followed by some technical challenges in guaranteeing its performance. Then we present a preliminary implementation of the LDPO framework, and validate its performance in terms of privacy preservation level and data utility using real-world apps and datasets. Some future directions are finally envisioned for further research. [ABSTRACT FROM AUTHOR]

Releasing representative data sets without compromising the data privacy has attracted increasing attention from the database community in recent years. Differential privacy is an influential privacy framework for data mining and data release without revealing sensitive information. However, existing solutions using differential privacy cannot effectively handle the release of high-dimensional data due to the increasing perturbation errors and computation complexity. To address the deficiency of existing solutions, we propose DPPro, a differentially private algorithm for high-dimensional data release via random projection to maximize utility while guaranteeing privacy. We theoretically prove that DPPro can generate synthetic data set with the similar squared Euclidean distance between high-dimensional vectors while achieving $(\epsilon,\delta)$ -differential privacy. Based on the theoretical analysis, we observed that the utility guarantees of released data depend on the projection dimension and the variance of the noise. Extensive experimental results demonstrate that DPPro substantially outperforms several state-of-the-art solutions in terms of perturbation error and privacy budget on high-dimensional data sets. [ABSTRACT FROM PUBLISHER]

By moving service provisioning from the cloud to the edge, edge computing becomes a promising solution in the era of IoT to meet the delay requirements of IoT applications, enhance the scalability and energy efficiency of lightweight IoT devices, provide contextual information processing, and mitigate the traffic burdens of the backbone network. However, as an emerging field of study, edge computing is still in its infancy and faces many challenges in its implementation and standardization. In this article, we study an implementation of edge computing, which exploits transparent computing to build scalable IoT platforms. Specifically, we first propose a transparent computing based IoT architecture, and clearly identify its advantages and associated challenges. Then, we present a case study to clearly show how to build scalable lightweight wearables with the proposed architecture. Some future directions are finally pointed out to foster continued research efforts. [ABSTRACT FROM AUTHOR]