首页> 外文会议>IEEE International Conference on Semantic Computing >Reducing search space for Web Service ranking using semantic logs and Semantic FP-Tree based association rule mining
【24h】

Reducing search space for Web Service ranking using semantic logs and Semantic FP-Tree based association rule mining

机译:使用语义日志和基于语义FP-Tree的关联规则挖掘来减少Web Service排名的搜索空间

获取原文

摘要

Ranking and Adaptation (used interchangeably) is often carried out using functional and non-functional information of Web Services. Such approaches are dependent on heavy and rich semantic descriptions as well as unstructured and scattered information about any past interactions between clients and Web Services. Existing approaches are either found to be focusing on semantic modeling and representation only, or using data mining and machine learning based approaches on unstructured and raw data to perform discovery and ranking. We propose a novel approach to allow semantically empowered representation of logs during Web Service execution and then use such logs to perform ranking and adaptation of discovered Web Services. We have found that combining both approaches together into a hybrid approach would enable formal representation of Web Services data which would boost data mining as well as machine learning based solutions to process such data. We have built Semantic FP-Trees based technique to perform association rule learning on functional and non-functional characteristics of Web Services. The process of automated execution of Web Services is improved in two steps, i.e., (1) we provide semantically formalized logs that maintain well-structured and formalized information about past interactions of Services Consumers and Web Services, (2) we perform an extended association rule mining on semantically formalized logs to find out any possible correlations that can used to pre-filter Web Services and reduce search space during the process of automated ranking and adaptation of Web Services. We have conducted comprehensive evaluation to demonstrate the efficiency, effectiveness and usability of our proposed approach.
机译:排名和适应(可互换使用)通常使用Web服务的功能和非功能信息来进行。这样的方法取决于沉重而丰富的语义描述以及有关客户端与Web服务之间过去的任何交互的非结构化和分散的信息。发现现有方法要么只专注于语义建模和表示,要么使用数据挖掘和基于机器学习的方法对非结构化和原始数据进行发现和排名。我们提出了一种新颖的方法,允许在Web Service执行期间以语义方式授权日志的表示,然后使用此类日志对发现的Web Service进行排名和调整。我们发现,将这两种方法结合在一起成为一种混合方法,将可以正式表示Web服务数据,这将促进数据挖掘以及基于机器学习的解决方案来处理此类数据。我们已经建立了基于语义FP-Trees的技术来对Web服务的功能和非功能特性执行关联规则学习。 Web服务的自动执行过程在两个步骤中得到了改进,即(1)我们提供了语义形式化的日志,该日志维护了有关服务使用者和Web服务的过去交互的结构良好和形式化的信息,(2)我们执行了扩展的关联在语义形式化日志上进行规则挖掘,以找出可用于对Web服务进行自动排名和调整过程中的预过滤Web服务并减少搜索空间的任何可能的关联。我们进行了全面的评估,以证明我们提出的方法的效率,有效性和可用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号