摘要
针对P2P网络的动态性、分布性等特点,提出了一种运用加权改进的K-Wmeans算法对Web服务进行聚类分析的方法。通过对P2P网络中各个节点上Web服务进行分布式聚类,可使服务请求者按照类别更准确快速地发现所需的Web服务。最后分析了算法的时间复杂度,并通过实验证明了此种方法在P2P环境下的Web服务聚类中存在一定的优越性。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第24期99-101,129,共4页
Computer Engineering and Applications
基金
山东省自然科学基金NoY2008G22~~
