LC-NPLA: Label and Community Information-Based Network Presentation Learning Algorithm

Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some limitations.For instance,only the structural information of nodes is considered when these kinds of algorithms are constructed.Aiming at this issue,a label and community information-based network presentation learning algorithm(LC-NPLA)is proposed in this paper.First of all,by using the community information and the label information of nodes,the first-order neighbors of nodes are reconstructed.In the next,the random walk strategy is improved by integrating the degree information and label information of nodes.Then,the node sequence obtained from random walk sampling is transformed into the node representation vector by the Skip-Gram model.At last,the experimental results on ten real-world networks demonstrate that the proposed algorithm has great advantages in the label classification,network reconstruction and link prediction tasks,compared with three benchmark algorithms.

MINE:A Method of Multi-Interaction Heterogeneous Information Network Embedding

Interactivity is the most significant feature of network data,especially in social networks.Existing network embedding methods have achieved remarkable results in learning network structure and node attributes,but do not pay attention to the multi-interaction between nodes,which limits the extraction and mining of potential deep interactions between nodes.To tackle the problem,we propose a method called Multi-Interaction heterogeneous information Network Embedding(MINE).Firstly,we introduced the multi-interactions heterogeneous information network and extracted complex heterogeneous relation sequences by the multi-interaction extraction algorithm.Secondly,we use a well-designed multi-relationship network fusion model based on the attention mechanism to fuse multiple interactional relationships.Finally,applying a multitasking model makes the learned vector contain richer semantic relationships.A large number of practical experiments prove that our proposed method outperforms existing methods on multiple data sets.

Semi-GSGCN: Social Robot Detection Research with Graph Neural Network

Malicious social robots are the disseminators of malicious information on social networks,which seriously affect information security and network environments.Efficient and reliable classification of social robots is crucial for detecting information manipulation in social networks.Supervised classification based on manual feature extraction has been widely used in social robot detection.However,these methods not only involve the privacy of users but also ignore hidden feature information,especially the graph feature,and the label utilization rate of semi-supervised algorithms is low.Aiming at the problems of shallow feature extraction and low label utilization rate in existing social network robot detection methods,in this paper a robot detection scheme based on weighted network topology is proposed,which introduces an improved network representation learning algorithm to extract the local structure features of the network,and combined with the graph convolution network(GCN)algorithm based on the graph filter,to obtain the global structure features of the network.An end-to-end semi-supervised combination model(Semi-GSGCN)is established to detect malicious social robots.Experiments on a social network dataset(cresci-rtbust-2019)show that the proposed method has high versatility and effectiveness in detecting social robots.In addition,this method has a stronger insight into robots in social networks than other methods.

Community Discovery Algorithm Based on Multi-Relationship Embedding

Complex systems in the real world often can be modeled as network structures,and community discovery algorithms for complex networks enable researchers to understand the internal structure and implicit information of networks.Existing community discovery algorithms are usually designed for single-layer networks or single-interaction relationships and do not consider the attribute information of nodes.However,many real-world networks consist of multiple types of nodes and edges,and there may be rich semantic information on nodes and edges.The methods for single-layer networks cannot effectively tackle multi-layer information,multi-relationship information,and attribute information.This paper proposes a community discovery algorithm based on multi-relationship embedding.The proposed algorithm first models the nodes in the network to obtain the embedding matrix for each node relationship type and generates the node embedding matrix for each specific relationship type in the network by node encoder.The node embedding matrix is provided as input for aggregating the node embedding matrix of each specific relationship type using a Graph Convolutional Network(GCN)to obtain the final node embedding matrix.This strategy allows capturing of rich structural and attributes information in multi-relational networks.Experiments were conducted on different datasets with baselines,and the results show that the proposed algorithm obtains significant performance improvement in community discovery,node clustering,and similarity search tasks,and compared to the baseline with the best performance,the proposed algorithm achieves an average improvement of 3.1%on Macro-F1 and 4.7%on Micro-F1,which proves the effectiveness of the proposed algorithm.