Attributed network community detection based on network embedding and parameter-free clustering

DyLFG: A Dynamic Network Learning Framework Based on Geometry

Dynamic network representation learning has recently attracted increasing attention because real-world networks evolve over time, that is nodes and edges join or leave the networks over time. Different from static networks, the representation learning of dynamic networks should not only consider how to capture the structural information of network snapshots, but also consider how to capture the temporal dynamic information of network structure evolution from the network snapshot sequence. From the existing work on dynamic network representation, there are two main problems: (1) A significant number of methods target dynamic networks, which only allow nodes to increase over time, not decrease, which reduces the applicability of such methods to real-world networks. (2) At present, most network-embedding methods, especially dynamic network representation learning approaches, use Euclidean embedding space. However, the network itself is geometrically non-Euclidean, which leads to geometric inconsistencies between the embedded space and the underlying space of the network, which can affect the performance of the model. In order to solve the above two problems, we propose a geometry-based dynamic network learning framework, namely DyLFG. Our proposed framework targets dynamic networks, which allow nodes and edges to join or exit the network over time. In order to extract the structural information of network snapshots, we designed a new hyperbolic geometry processing layer, which is different from the previous literature. In order to deal with the temporal dynamics of the network snapshot sequence, we propose a gated recurrent unit (GRU) module based on Ricci curvature, that is the RGRU. In the proposed framework, we used a temporal attention layer and the RGRU to evolve the neural network weight matrix to capture temporal dynamics in the network snapshot sequence. The experimental results showed that our model outperformed the baseline approaches on the baseline datasets.

Recommendation algorithm based on attributed multiplex heterogeneous network

In the field of deep learning, the processing of large network models on billions or even tens of billions of nodes and numerous edge types is still flawed, and the accuracy of recommendations is greatly compromised when large network embeddings are applied to recommendation systems. To solve the problem of inaccurate recommendations caused by processing deficiencies in large networks, this paper combines the attributed multiplex heterogeneous network with the attention mechanism that introduces the softsign and sigmoid function characteristics and derives a new framework SSN_GATNE-T (S represents the softsign function, SN represents the attention mechanism introduced by the Softsign function, and GATNE-T represents the transductive embeddings learning for attribute multiple heterogeneous networks). The attributed multiplex heterogeneous network can help obtain more user-item information with more attributes. No matter how many nodes and types are included in the model, our model can handle it well, and the improved attention mechanism can help annotations to obtain more useful information via a combination of the two. This can help to mine more potential information to improve the recommendation effect; in addition, the application of the softsign function in the fully connected layer of the model can better reduce the loss of potential user information, which can be used for accurate recommendation by the model. Using the Adam optimizer to optimize the model can not only make our model converge faster, but it is also very helpful for model tuning. The proposed framework SSN_GATNE-T was tested for two different types of datasets, Amazon and YouTube, using three evaluation indices, ROC-AUC (receiver operating characteristic-area under curve), PR-AUC (precision recall-area under curve) and F1 (F1-score), and found that SSN_GATNE-T improved on all three evaluation indices compared to the mainstream recommendation models currently in existence. This not only demonstrates that the framework can deal well with the shortcomings of obtaining accurate interaction information due to the presence of a large number of nodes and edge types of the embedding of large network models, but also demonstrates the effectiveness of addressing the shortcomings of large networks to improve recommendation performance. In addition, the model is also a good solution to the cold start problem.