13 January 2023 in IEEE Transactions on Services Computing
An increasing number and diversity of services are available, which results in significant challenges to effectively reuse service during mashup creation. Many works have modeled the mashup creation problem as a service recommendation task and have achieved remarkable results. However, the performance of these methods can be further improved. The main problems affecting these methods include the constraints among recommended services, the evolution of services, and the semantic gap existing in services and mashups. In this paper, we model the mashup creation problem as a service bundle recommendation task that is formally defined to address the constraints among recommended services. And then, a dynamic graph neural network based model called DySR is proposed to tackle the evolution of service and the semantic gap between services and mashups. In order to quantitatively measure how significant the semantic gap between mashups and services is, a measurement method of a semantic gap is given. With it, experiments show that to what extent DySR can reduce the semantic gap in the context of mashup creation. In addition, new evaluation metrics are introduced to overcome the preference for popular services in traditional service recommendations. Extensive experiments conducted on a real-world dataset from ProgrammableWeb, and the experiment results show that DySR outperforms existing state-of-the-art methods.
25 December 2023 in IEEE Transactions on Services Computing
QoS (Quality of Service) prediction is a fundamental task for downstream service computing tasks. Yet, how to predict QoS still remains a non-trivial issue. Existing works try to address this problem by either better modeling the impact between users and services or learning better user/service feature embeddings. Despite the challenges, modeling the two aspects jointly can improve the performance of QoS prediction. However, existing works have rarely attempted this approach. In this regard, Graph Neural Networks (GNNs), with their ability to model these two aspects simultaneously, present an exciting opportunity to advance QoS prediction. Unfortunately, GNNs have not yet been systematically studied in this context, and their potential for improving QoS prediction warrants further investigation. In this paper, we apply GNN to the QoS prediction task by proposing a framework called QoSGNN. In this framework, we systematically explore all steps required when applying GNN to QoS prediction and discuss each step's design principles and advantages. Based on these design principles, we provide an implementation of QoSGNN and conduct extensive experiments on a real-world QoS dataset. The experimental results show that our proposed QoSGNN not only significantly outperforms the baselines in terms of QoS prediction performance but also substantially improves other aspects such as cold start, scalability, robustness, and fairness.
1 December 2021 in Journal of Systems and Software
8 January 2024 in ACM Transactions on the Web
Dynamic link prediction has become a trending research subject because of its wide applications in the web, sociology, transportation, and bioinformatics. Currently, the prevailing approach for dynamic link prediction is based on graph neural networks, in which graph representation learning is the key to perform dynamic link prediction tasks. However, there are still great challenges because the structure of graphs evolves over time. A common approach is to represent a dynamic graph as a collection of discrete snapshots, in which information over a period is aggregated through summation or averaging. This way results in some fine-grained time-related information loss, which further leads to a certain degree of performance degradation. We conjecture that such fine-grained information is vital because it implies specific behavior patterns of nodes and edges in a snapshot. To verify this conjecture, we propose a novel fine-grained behavior-aware network (BehaviorNet) for dynamic network link prediction. Specifically, BehaviorNet adapts a transformer-based graph convolution network to capture the latent structural representations of nodes by adding edge behaviors as an additional attribute of edges. GRU is applied to learn the temporal features of given snapshots of a dynamic network by utilizing node behaviors as auxiliary information. Extensive experiments are conducted on several real-world dynamic graph datasets, and the results show significant performance gains for BehaviorNet over several state-of-the-art (SOTA) discrete dynamic link prediction baselines. Ablation study validates the effectiveness of modeling fine-grained edge and node behaviors.
26 July 2023 in IEEE Transactions on Neural Networks and Learning Systems
Temporal graph neural network (GNN) has recently received significant attention due to its wide application scenarios, such as bioinformatics, knowledge graphs, and social networks. There are some temporal GNNs that achieve remarkable results. However, these works focus on future event prediction and are performed under the assumption that all historical events are observable. In real-world applications, events are not always observable, and estimating event time is as important as predicting future events. In this article, we propose MTGN, a missing event-aware temporal GNN, which uniformly models evolving graph structure and timing of events to support predicting what will happen in the future and when it will happen. MTGN models the dynamic of both observed and missing events as two coupled temporal point processes (TPPs), thereby incorporating the effects of missing events into the network. Experimental results on several real-world temporal graphs demonstrate that MTGN significantly outperforms the existing methods with up to 89% and 112% more accurate time and link prediction. Code can be found on https://github.com/HIT-ICES/TNNLS-MTGN .