{'fraction_non_alphanumeric': 0.014167650531286895, 'fraction_numerical': 0.0011806375442739079, 'mean_word_length': 5.78, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Bilinear Graph Neural Network-Enhanced Web Services Classification

With the growing number of Web services, classifying Web services accurately and efficiently has become a challenging problem. Effective service classification is conducive to improving the quality of service discovery and the efficiency of service composition. Existing graph neural network methods represent the target service node by a weighted sum of the features of the neighbor service nodes, and have achieved remarkable results in service classification. However, these methods ignore the impact of possible interactions between neighbor service nodes on the target service node. To address this problem, we propose a Web services classification method based on bilinear graph neural network. Our proposed method can model the bilinear interactions between neighbor service nodes and effectively improve the accuracy of service classification. First, our proposed model uses the Word2Vec model to extract the latent semantic vectors from service description documents. We then construct the service relationship network according to tags and shared annotation relationships of Web services. Next, a bilinear aggregator is used to model the pairwise interactions between neighbor service nodes, highlighting the local common attributes. Finally, the bilinear aggregator is combined with the weighted sum aggregator to construct a bilinear graph neural network, which can learn more comprehensive representations of services. The experimental results on the real dataset from ProgrammableWeb show that the classification accuracy of the proposed method is greatly improved compared with DeepWalk, Node2Vec, GCN, and GAT.