Matching Algorithm of Web Services Based on Semantic Distance

摘要：

With the growing number of web services ,the importance of matching and discovery web services is increasing. Using domain ontology to describe the semantic of web services and matching the web services on the semantic level is a hot research pot. in this paper, the problem of matching web services is transformed to the computation of semantic similarity between concepts in domain ontology. We propose the semantic similarity can be measured from the semantic distance and consider the factors of pathlengh, depth, local density and numberofdowndir ection in the algorithm. We establish that such a measure is an effective means of discriminating services at a level of granularity that is able to enhance the matching process in semantic web services.

关键词： domain ontology matchmaking the Web Services semantic similarity semantic distance

作者: Pengbin Fu Shanshan Liu Huirong Yang Liheng Gu

作者单位: Beijing university of technology,beijing,China Beijing university of technology,Beijing, China

会议类型: 国际会议

会议名称: 2009 International Workshop on Information Security and Application(2009 信息安全与应用国际研讨会)

会议地点: 青岛

会议语种:英文

页码: 465-468

在线出版日期: 2009-11-21（万方平台首次上网日期，不代表论文的发表时间）