Heterogeneous Graph Attention Network-Enhanced Web Service Classification

Abstract

Service classification helps to improve the efficiency of service discovery. Previous methods mainly focus on homogeneous graph-based service classification. However, due to the heterogeneity of service data in the real world, these methods cannot deal with many types of nodes and edges in service relationship network well, and lack the usage of rich semantic information. The emergence of heterogeneous graph attention network can effectively solve the problems, because it can more completely and naturally extracts the relationships and nodes from the service relationship network, and well distinguishes the importance of neighbor nodes and meta paths. Therefore, this paper proposes a heterogeneous graph attention network-enhanced Web service classification method. In this method, firstly, a heterogeneous information service network is constructed by using composite service information, atomic service information and their attribute information. Then, the meta path is defined according to different semantic information, and the similarity matrix of service is constructed by using the commuting matrix and the similarity measurement technology based on meta path. Finally, a two-layer attention model is designed to calculate the node-level attention and meta path-level attention of the service, so as to obtain the node-level representations and meta path-level representations of the services, and generate more representative embedding features of services for achieving more accurate service classification. Finally, the experimental results on real datasets of ProgrammableWeb show that our method is better than GAT, GCN, Metapath2Vec, Node2Vec, BiLSTM and LDA in terms of precision, recall and macro F1, and improves the accuracy of Web service classification.