一种服务挖掘算法的研究与实现  

Research and implementation of service mining algorithm

作　　者：张成[1,2] 张璟[1] 

机构地区：[1]西安理工大学计算机科学与工程学院,西安710048 [2]延安大学网络中心,陕西延安716000

出　　处：《计算机工程与应用》2010年第4期117-119,共3页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863) No.2007AA010305;陕西省科技计划项目No.2006K04-G10;延安市科技计划项目No.2009KG-10~~

摘　　要：如何从大范围的服务集合中有效、准确地发现目标服务是服务研究领域的重点和难点。提出了一种基于OWL-S的服务挖掘算法,该算法通过对服务发布和服务请求文档中的关键字及其频度产生权值,根据相识度算法来确定权值在一定范围内的服务是否匹配,从而找到目标服务,给出了算法的描述、计算方法及实现流程。最后,通过对实例进行实现和分析,表明该方法比现有文献有较大的提高。How to discover the target service for users efficiently and accurately is the key and difficult point of the Web service research field.A service mining algorithm is proposed based on the OWL-S describing language.Some weights are produced through calculating the key term of the service publisher documents and the service requester documents and their frequency.The similarity algorithm judges whether the two which weights are in some range are matched,then finds the target.The description and the computation method and the flow chart of the algorithm are provided.Finally, a practical instance is analyzed and implemented which demonstrates a superior performance than the others.

关 键 词：本体服务描述语言(OWL—S) 服务挖掘 权重 相识度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]