This paper analyses the problems existing in the semantic matching methods in the typical distributed UDDI networks. By expanding the classical elastic matching algorithm,the author uses the GCSM semantic distance algorithm, class factor and category factor to present an improved matching algorithm of semantic Web services.This algorithm can be used to compute the match degree of Web services so that the match results approach the request.
彭薇. 一种改进的语义Web服务匹配算法*[J]. 现代图书情报技术, 2007, 2(10): 76-79.
Peng Wei. An Improved Matching Algorithm of Semantics Web Services. New Technology of Library and Information Service, 2007, 2(10): 76-79.
［1］ Bellwood T,Ehnebuske D,et al. UDDI Version 2.03 Data Structure Reference［S］. UDDI Committee Specification, OASIS Publications, 2002
［2］ Verma K,Sivashanmugam K,Sheth S,et al. METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services［J］. Journal of Information Technology and Management,2005,6(1):17-39.
［3］ 陈德伟，许斌，蔡月茹，等. 服务部署与发布绑定的基于P2P网络的Web服务发现机制［J］. 计算机学报, 2005, 28(4): 615-626.
［4］ 刘兴伟，崔晓红. UDDI的语义扩展及分布式实现［J］. 微电子学与计算机，2006，23（9）：179-181
［5］ Ganesan P,Garcia-Molina H,Widom J. Exploiting Hierarchical Domain Structure to Compute Similarity［J］.ACM Transactions on Information Systems,2003,21(1):64-93.
