摘要
分析了传统的Web服务发现机制,发现利用关键字进行Web服务匹配的服务查全率和查准率不高。对服务发现中的服务匹配算法进行改进,提出了一种基于语义的Web服务二次匹配算法。结合关键字和概念层语义关系进行服务匹配,根据匹配度选择最优服务。该算法提高了服务匹配效率,实现了灵活的服务发现机制,其灵活性和扩展性能够实现复杂的Web服务发现。
To analyze traditional Web services discovery mechanism, service recall ratio is discovered and precision ratio is very low. To improve the service match arithmetic in Web services discovery, this paper presents a semantics-based Web services secondary match algorithm. The algorithm makes services match based on keyword technology and semantic relationship at conceptual level, and chooses the best service according to match degree. The algorithm improves the efficiency of match services and achieves a flexible service discovery mechanism. It is flexible and extensible to accomplish complex Web service requests.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第17期83-85,共3页
Computer Engineering
基金
国家自然科学基金(60472127)
