Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (24): 99-101.DOI: 10.3778/j.issn.1002-8331.2009.24.030

• 网络、通信、安全 • Previous Articles     Next Articles

Research of Web services discovery based on K-Wmeans data cluster algorithm in P2P environments

LI Jing,ZHANG Yong-sheng,LIU Guang-yu,WANG Ying   

  1. School of Information Science and Engineering,Shandong Normal University,Jinan 250014,China
  • Received:2009-05-08 Revised:2009-06-29 Online:2009-08-21 Published:2009-08-21

P2P网络下基于K-Wmeans聚类算法的Web服务发现研究

李 静,张永胜,刘广钰,王 莹   

  1. 山东师范大学 信息科学与工程学院,济南 250014
  • 通讯作者: 李 静

Abstract: The nodes in P2P environments are dynamic and distributed,aiming at which this paper presents a new method to carry out cluster analysis of Web services based on the weighted K-Wmeans algorithm.Web services on each node in P2P network are carried through distributed clustering analysis,in which way service requester can find the needed Web services more accurately and quickly in accordance with the categories.In the final the paper analyzes the algorithm’s time complexity and the experiments show that there is superiority for the use of this method in the cluster of Web services in P2P environments.

Key words: Web services discovery, distributed clustering, K-Wmeans, P2P

摘要: 针对P2P网络的动态性、分布性等特点,提出了一种运用加权改进的K-Wmeans算法对Web服务进行聚类分析的方法。通过对P2P网络中各个节点上Web服务进行分布式聚类,可使服务请求者按照类别更准确快速地发现所需的Web服务。最后分析了算法的时间复杂度,并通过实验证明了此种方法在P2P环境下的Web服务聚类中存在一定的优越性。

关键词: Web服务发现, 分布式聚类, K-Wmeans, P2P

CLC Number: