Web Services Matchmaking with Vectors Combination

• Main Authors: Che-An Lee, 李哲安
• Other Authors: 李允中
• Format: Others
• Language: en_US
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/q8x873

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === In text-based service matchmaking approach, since the web service is treated as a plain text and use term tokens as the internal representation to match services, the accuracy of the text comparison will affect the performance of service matchmaking. In this research, we improve the performance of service matchmaking through the following four steps: 1. extract keywords from WSDL and convert them into vector representations through pre-trained word vector model, 2. extract word relations from reference data, 3. use word relations for vector combination to improve the quality of pre-trained word vectors, and 4. calculate the cosine similarity between keyword word vectors to get the similarity of two web services. An experiment is also conducted based on an OWLS-TC V4 service matchmaking benchmark with hypothesis testing to compare our proposed approach with the iSeM approach. The result of the experiment shows that our approach (MAP=0.9242) excels iSeM (MAP=0.8529) by.