The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods, aiming at learning a continuous vector space for the graph, which is amenable to be adopted in traditional machine learning algorithms in favor of vector representations. Graph embedding methods build an important bridge between social network analysis and data analytics, as social networks naturally generate an unprecedented volume of graph data continuously. Publishing social network data not only brings benefit for public health, disaster response, commercial promotion, and many other applications, but also gives birth to threats that jeopardize each individual’s privacy and security. Unfortunately, most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social networks. To be specific, attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network embedding. In this paper, we propose a novel link-privacy preserved graph embedding framework using adversarial learning, which can reduce adversary’s prediction accuracy on sensitive links, while persevering sufficient non-sensitive information, such as graph topology and node attributes in graph embedding. Extensive experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

The ever increasing requirements of data sensing applications result in the usage of IoT networks. These networks are often used for efficient data transfer. Wireless sensors are incorporated in the IoT networks to reduce the deployment and maintenance costs. Designing an energy efficient data aggregation method for sensor equipped IoT to process skyline query, is one of the most critical problems. In this paper, we propose two approximation algorithms to process the skyline query in wireless sensor networks. These two algorithms are uniform sampling-based approximate skyline query and Bernoulli sampling-based approximate skyline query. Solid theoretical proofs are provided to confirm that the proposed algorithms can yield the required query results. Experiments conducted on actual datasets show that the two proposed algorithms have high performance in terms of energy consumption compared to the simple distributed algorithm.

As Internet-of-Things (IoT) networks provide efficient ways to transfer data, they are used widely in data sensing applications. These applications can further include wireless sensor networks. One of the critical problems in sensor-equipped IoT networks is to design energy efficient data aggregation algorithms that address the issues of maximum value and distinct set query. In this paper, we propose an algorithm based on uniform sampling and Bernoulli sampling to address these issues. We have provided logical proofs to show that the proposed algorithms return accurate results with a given probability. Simulation results show that these algorithms have high performance compared with a simple distributed algorithm in terms of energy consumption.