ARTICLE | doi:10.20944/preprints202211.0111.v1
Subject: Computer Science And Mathematics, Information Systems Keywords: Recommendation, GNN, Preference
Online: 7 November 2022 (08:38:06 CET)
With the rapid development of technology and the advancement of Internet technology, various social networking platforms are gradually coming into people's view and occupying a higher and higher position. In the recommendation scenario, the user-item interaction naturally forms a bipartite heterogeneous graph structure and with the development of graph embedding and graph neural network technologies based on deep learning to process graph domain information, the combination of graph information and recommendation systems shows strong research potential and application prospects. The methodological improvement of the recommendation algorithm based on collaborative filtering takes advantage of the nature that user-items can form a bipartite graph in the recommendation scenario. The existing methods still have some shortcomings. The methods that only use weights or convolutional recurrent neural networks to implicitly model different historical behaviors lack explicit modeling of video switching relationships in serialized behaviors. The user's interest is changing all the time, so it is not possible to recommend based on the user's history, and it is necessary to consider both the long-term and short-term interest of the user according to the video content in order to achieve accurate recommendation of short videos. In this paper, we design a recommendation model based on graph neural network, which models users' long-term and short-term interests by two vector propagation methods, respectively.
ARTICLE | doi:10.20944/preprints202302.0196.v1
Subject: Computer Science And Mathematics, Information Systems Keywords: Recommendation; GNN; Information; Feature; Structure
Online: 13 February 2023 (03:28:02 CET)
With the rapid development of the Internet industry, the problem of information overload has arisen due to the abundance of information available online. Recommendation algorithms, as the core of recommendation systems, have been attracting much attention and are a hot topic of research for many experts and scholars. The classical recommendation algorithms are mainly divided into three major categories: collaborative filtering recommendation algorithms, content-based recommendation algorithms, and hybrid-based recommendation algorithms. Although these algorithms are widely used in various fields, with the proliferation of information, these traditional recommendation algorithms are no longer able to meet the needs of the times. To address this issue, recommendation systems have been developed to provide users with personalized and relevant information or products. Despite the wide use of recommendation algorithms, such as collaborative filtering, content-based filtering, and hybrid approaches, traditional recommendation algorithms have limitations and are no longer suitable for meeting the demands of the times. This paper proposes a new recommendation algorithm, SFRRG, that fuses structure and feature information in graph neural networks to improve the performance of the recommendation system in rating prediction. The effectiveness of the proposed algorithm is demonstrated through experiments on various data sets and compared with existing recommendation algorithms.
ARTICLE | doi:10.20944/preprints202211.0534.v1
Subject: Computer Science And Mathematics, Information Systems Keywords: Recommendation; GNN, Feature; Path; Embedding
Online: 29 November 2022 (04:19:09 CET)
Recommender systems as an effective information filtering system can be used to obtain information through the user's explicit or implicit behavior. On the one hand finding items that may be of interest to the user. On the other hand, the recommendation facilitates the interaction between the user and the item to increase the revenue. Recommender systems have been widely used in various fields, such as e-commerce, travel recommendation, online books and movies, social networks, etc, which can satisfy the intrinsic implicit needs of users through personalized services. In recent years, the development of deep learning has further improved the performance of recommendation systems. Although these methods improve the performance of the recommendation system, when the number of users and products increases, the recommendation system may face sparsity and cold start problems, and thus cannot achieve personalized recommendations. Knowledge graphs, which are structured data, have become the choice of many algorithms due to the high quality and wide scale of the data, and therefore many recommendation algorithms combined with knowledge graphs have emerged as a popular new direction in recommendation systems. These algorithms are able to preserve the rich connections between different entities. Moreover, when constructing the features of an entity, the entities that are far away from the central entity can also be utilized. Entities are no longer only directly connected to each other. To address the shortcomings of existing recommendation algorithms, this paper designs the recommendation algorithm GPRE using graph neural networks. GPRE focuses on expressing the user's features. The graph neural network provides GPRE with a strong generalization capability for modeling, which can provide long-range semantics between users and entities, as well as selective entity selection in the auxiliary graph neural network. Explicit semantic links are established between remote and central nodes to reduce the introduction of noise. In this paper, experiments are conducted on real-world datasets and the results are compared with baselines. The experimental results show that GPRE performs well on the experimental dataset.
REVIEW | doi:10.20944/preprints202310.1655.v1
Subject: Medicine And Pharmacology, Oncology And Oncogenics Keywords: Graph Neural Network; GNN; Deep Learning; Cancer; Oncology; Graphical Model; Bayesian Network
Online: 26 October 2023 (03:33:36 CEST)
Next-generation cancer and oncology research needs to take full advantage of the multi-modal structured, or graph, information, with the graph datatypes ranging from molecular structures to spatially resolved imaging and digital pathology to biological networks to knowledge graphs. Graph Neural Networks (GNNs) efficiently combine the graph structure representations with the high predictive performance of deep learning, especially on the large multi-modal datasets. In this review article, we survey the landscape of recent (2020-present) GNN applications in the context of cancer and oncology research, and delineate six currently predominant research areas. Subsequently, we identify the most promising directions for future research. We compare GNNs with graphical models and "non-structured" deep learning, and devise the guidelines for cancer and oncology researchers or physician-scientists asking the question of whether they should adopt the GNN methodology in their research pipelines.
ARTICLE | doi:10.20944/preprints202306.1288.v1
Subject: Computer Science And Mathematics, Artificial Intelligence And Machine Learning Keywords: Traffic shaping; Anomaly detection; Intrusion detection; Network security; Internet of Things; Network traffic analysis; Machine learning. (SDN (Software-defined networking); GNN (Graph neural network); MAB (Multi-armed bandit))
Online: 19 June 2023 (04:55:33 CEST)
Traffic shaping is a critical task in software-defined -IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic shaping approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and Multi-arm Bandit algorithms to dynamically optimize traffic shaping policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a Multi-arm Bandit algorithm to optimize traffic shaping policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic shaping methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic shaping in SDNs, enabling efficient resource management and QoS assurance