Interlayer Link Prediction in Multiplex Social Networks Based on Multiple Types of Consistency Between Embedding Vectors

Multi-level social network alignment via adversarial learning and graphlet modeling

Aiming to identify corresponding users in different networks, social network alignment is significant for numerous subsequent applications. Most existing models apply consistency assumptions on undirected networks, ignoring platform disparity caused by diverse functionalities and universal directed relations like follower-followee. Due to indistinguishable nodes and relations, subgraph isomorphism is also unavoidable in neighborhoods. In order to precisely align directed and attributed social networks, we propose the Multi-level Adversarial and Graphlet-based Social Network Alignment (MAGSNA), which unifies networks as a whole at individual-level and learns discriminative graphlet-based features at partition-level simultaneously, thereby alleviating both platform disparity and subgraph isomorphism. Specifically, at individual-level, we relieve topology disparity by the random walk with restart, while developing directed weight-sharing network embeddings and a bidirectional optimizer on Wasserstein graph adversarial networks for attribute disparity. At partition-level, we extract overlapped partitions from graphlet orbits, then design weight-sharing partition embeddings and a hubness-aware refinement to derive discriminative features. By fusing the similarities of these two levels, we obtain a precise and thorough alignment. Experiments on real-world and synthetic datasets demonstrate that MAGSNA outperforms state-of-the-art methods, exhibiting competitive efficiency and superior robustness.

Vertical Memristive Crossbar Array for Multilayer Graph Embedding and Analysis

Graph data structures effectively represent objects and their relationships, enabling the modeling of complex connections in various fields. Recent work demonstrate that metal at diagonal crossbar arrays (m-CBA) can effectively represent planar graphs. However, they are unsuitable for representing multilayer graphs having multiple relationships across different layers. Using conventional software, embedding multilayer graphs in high-dimensional Euclidean spaces introduces significant mathematical complexity and computational burden, often resulting in information loss. This study proposes a unique graph embedding (mapping) method utilizing a fabricated vertical m-CBA (vm-CBA), where a custom-built measurement system thoroughly validated its functionality. This structure directly maps multilayer graphs into a 3D vm-CBA, accurately representing inter-layer and intra-layer connections. The practical link prediction and information scores across various real-world datasets demonstrated that vm-CBA achieved enhanced accuracy compared to conventional embeddings, even with a significantly decreased number of operations.

A Semantic-Enhancement-Based Social Network User-Alignment Algorithm

User alignment can associate multiple social network accounts of the same user. It has important research implications. However, the same user has various behaviors and friends across different social networks. This will affect the accuracy of user alignment. In this paper, we aim to improve the accuracy of user alignment by reducing the semantic gap between the same user in different social networks. Therefore, we propose a semantically enhanced social network user alignment algorithm (SENUA). The algorithm performs user alignment based on user attributes, user-generated contents (UGCs), and user check-ins. The interference of local semantic noise can be reduced by mining the user's semantic features for these three factors. In addition, we improve the algorithm's adaptability to noise by multi-view graph-data augmentation. Too much similarity of non-aligned users can have a large negative impact on the user-alignment effect. Therefore, we optimize the embedding vectors based on multi-headed graph attention networks and multi-view contrastive learning. This can enhance the similar semantic features of the aligned users. Experimental results show that SENUA has an average improvement of 6.27% over the baseline method at hit-precision30. This shows that semantic enhancement can effectively improve user alignment.

A Comprehensive Analysis of Privacy-Preserving Solutions Developed for Online Social Networks

Owning to the massive growth in internet connectivity, smartphone technology, and digital tools, the use of various online social networks (OSNs) has significantly increased. On the one hand, the use of OSNs enables people to share their experiences and information. On the other hand, this ever-growing use of OSNs enables adversaries to launch various privacy attacks to compromise users’ accounts as well as to steal other sensitive information via statistical matching. In general, a privacy attack is carried out by the exercise of linking personal data available on the OSN site and social graphs (or statistics) published by the OSN service providers. The problem of securing user personal information for mitigating privacy attacks in OSNs environments is a challenging research problem. Recently, many privacy-preserving solutions have been proposed to secure users’ data available over OSNs from prying eyes. However, a systematic overview of the research dynamics of OSN privacy, and findings of the latest privacy-preserving approaches from a broader perspective, remain unexplored in the current literature. Furthermore, the significance of artificial intelligence (AI) techniques in the OSN privacy area has not been highlighted by previous research. To cover this gap, we present a comprehensive analysis of the state-of-the-art solutions that have been proposed to address privacy issues in OSNs. Specifically, we classify the existing privacy-preserving solutions into two main categories: privacy-preserving graph publishing (PPGP) and privacy preservation in application-specific scenarios of the OSNs. Then, we introduce a high-level taxonomy that encompasses common as well as AI-based privacy-preserving approaches that have proposed ways to combat the privacy issues in PPGP. In line with these works, we discuss many state-of-the-art privacy-preserving solutions that have been proposed for application-specific scenarios (e.g., information diffusion, community clustering, influence analysis, friend recommendation, etc.) of OSNs. In addition, we discuss the various latest de-anonymization methods (common and AI-based) that have been developed to infer either identity or sensitive information of OSN users from the published graph. Finally, some challenges of preserving the privacy of OSNs (i.e., social graph data) from malevolent adversaries are presented, and promising avenues for future research are suggested.

Social Relationship Prediction Integrating Personality Traits and Asymmetric Interactions

Social networks have become an important way for users to find friends and expand their social circle. Social networks can improve users’ experience by recommending more suitable friends to them. The key lies in improving the accuracy of link prediction, which is also the main research issue of this study. In the study of personality traits, some scholars have proved that personality can be used to predict users’ behavior in social networks. Based on these studies, this study aims to improve the accuracy of link prediction in directed social networks. Considering the integration of personality link preference and asymmetric interaction into the link prediction model of social networks, a four-dimensional link prediction model is proposed. Through comparative experiments, it is proved that the four-dimensional social relationship prediction model proposed in this study is more accurate than the model only based on similarity. At the same time, it is also verified that the matching degree of personality link preference and asymmetric interaction intensity in the model can help improve the accuracy of link prediction.