作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (22): 51-52. doi: 10.3969/j.issn.1000-3428.2011.22.014

• 软件技术与数据库 • 上一篇    下一篇

基于图论的语义Web服务聚类方法

黎 英   

  1. (哈尔滨工程大学经济管理学院,哈尔滨 150001)
  • 收稿日期:2011-05-20 出版日期:2011-11-18 发布日期:2011-11-20
  • 作者简介:黎 英(1973-),女,博士,主研方向:语义Web服务,电子商务,信息共享技术

Semantic Web Service Clustering Method Based on Graph Theory

LI Ying   

  1. (School of Economy and Management, Harbin Engineering University, Harbin 150001, China)
  • Received:2011-05-20 Online:2011-11-18 Published:2011-11-20

摘要: 提出一种基于图论的聚类方法,用于在语义Web服务类别数量未知的情况下实现领域服务分类。通过计算待分类服务的相似度矩阵,得到相似度阈值,将相似度矩阵中超过该阈值的元素置为1,其余元素置为0,由此得到服务连接矩阵,再以该矩阵为图,逐个提取其中的最大完全子图,每个子图的节点服务就是一个服务类。理论分析与实验结果证明,该方法可以通过一次聚类得到服务的自然分群,聚类时间较短。

关键词: 语义, Web服务, 聚类, 本体, 图论

Abstract: This paper proposes a semantic Web service clustering method wihtout knowing the number of kinds of services. The similarity matrix of the services is calculated, and the threshold value of similarity is calculated based on the matrix. Those elements which are greater than the threshold value are set 1, and the other elements are 0 in the similarity matrix, so that the connecting matrix of services based on the threshold is formed. Regarding the connecting matrix as a graph, it abstracts the biggest complete sub-graphs from this graph one by one. The services in each sub-graph are a kind of services. Theory analysis and experiments verify that the method can acquire nature clusters by one time of clustering in acceptable time.

Key words: semantic, Web service, clustering, ontology, graph theory

中图分类号: