Linghang Ding

dblp:298/3289 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2021
0000-0002-6011-075XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2021 QoS Prediction for Web Services via Combining Multi-component Graph Convolutional Collaborative Filtering and Deep Factorization Machine
abstract
QoS prediction for Web Services is becoming increasingly important for various QoS-aware Web Services management tasks. However, the existing methods for QoS prediction of Web Services have some drawbacks, such as poor performance in dealing with data sparsity, insufficient consideration of latent information in user-service interaction behavior, and no consideration on discriminating the weight of latent information. To address these shortcomings, this paper proposes a QoS Prediction approach via combining multi-component graph convolutional collaborative filtering and deep factorization machine. A user-service bipartite graph is constructed, and the edges of the graph are decomposed into multiple latent spaces with node-level attention to identify latent components. Then, the importances of latent components are determined, and they are aggregated to obtain the corresponding user-service embedding vectors. Finally, the embedding vectors are taken as the input of a deep factorization machines model to obtain the prediction of unknown QoS. Extensive experiments are conducted on a real-world dataset. The experimental results demonstrate that MGCCF-DFM achieves superior prediction accuracy in terms of mean absolute error (MAE) and root mean square error (RMSE) compared with the existing QoS prediction techniques.
Linghang Ding, Guosheng Kang, Jianxun Liu 0001, Yong Xiao 0002, Buqing Cao
ICWS1
2021 WSGCN4SLP: Weighted Signed Graph Convolutional Network for Service Link Prediction
abstract
Learning network representations of Web services plays a critical role in the service ecosystem and facilitates many downstream tasks, e.g., service composition, service recommendation, service clustering, and service classification, etc. However, the performance of most of the existing approaches is limited by the sparse and non-interaction relationships between services. Considering these shortcomings, by proposing a balance theory based weighted signed graph convolutional network, we explore a dedicated signed service link prediction method to expand accurate links in service relation networks. Concretely, we first define the positive and negative links based on historical prior knowledge concerning services, and then construct a signed service relation network. Furthermore, on the basis of quantifying the influence of different neighbor nodes, we employ balance theory to correctly aggregate and propagate the information across layers through a weighted signed graph convolutional network. Finally, we splice all service embeddings in pairs, and a multi-layer perceptron classifier is used to predict the links between services. Comparative experiments with six baselines demonstrate that our method significantly outperforms the state-of-the-art link prediction models.
Yong Xiao 0002, Guosheng Kang, Jianxun Liu 0001, Buqing Cao, Linghang Ding
ICWS5
2021 Tatt-BiLSTM: Web service classification with topical attention-based BiLSTM
abstract
Abstract With the rapid growth of the number of Web services on the Internet, how to classify Web services correctly and efficiently become particularly important in service management tasks, such as service discovery, service selection, service ranking, and service recommendation. Existing functionality‐based service classification techniques have some drawbacks: (1) the keyword order and context information are not considered; (2) the embedding features of keywords are taken as equal importance to learn the classification model; (3) the topic number is hard to determine manually. Due to these drawbacks, the accuracy of service classification needs to be improved further. At present, deep learning techniques show the strong power in modeling complex and nonlinear function relationship. Thus, to address the problems above, this paper exploits attention mechanism to combine the local implicit state vector of Bidirectional Long Short‐Term Memory Network (BiLSTM) and the global hierarchical Dirichlet process (HDP) topic vector, and proposes a Web service classification approach with topical attention‐based BiLSTM. Specifically, BiLSTM is used to automatically learn the keyword feature representations of Web services. Then, the topic vectors of Web service documents are obtained with HDP by offline training, and topic attention mechanism is adopted to strengthen the feature representation by discriminating the importance or weight of different keywords in Web service documents. Finally, the enhanced Web service feature representation is used as the input of a softmax neural network layer to perform the classification prediction for Web services. Extensive experiments are conducted to validate the effectiveness of the proposed approach.
Guosheng Kang, Yong Xiao 0002, Jianxun Liu 0001, Yingcheng Cao, Buqing Cao, Linghang Ding
Concurr. Comput. Pract. Exp.7