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

M. O. Shafiq, R. Alhajj, J. Rokne
{"title":"Reducing search space for Web Service ranking using semantic logs and Semantic FP-Tree based association rule mining","authors":"M. O. Shafiq, R. Alhajj, J. Rokne","doi":"10.1109/ICOSC.2015.7050771","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSC.2015.7050771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

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.
使用语义日志和基于语义fp树的关联规则挖掘减少Web服务排名的搜索空间
排名和适应(可互换使用)通常使用Web服务的功能和非功能信息来执行。这种方法依赖于大量和丰富的语义描述,以及关于客户端和Web服务之间任何过去交互的非结构化和分散的信息。现有的方法要么只关注语义建模和表示,要么使用基于非结构化和原始数据的数据挖掘和机器学习方法来执行发现和排名。我们提出了一种新颖的方法,允许在Web服务执行期间对日志进行语义授权表示,然后使用这些日志对发现的Web服务进行排序和调整。我们发现,将这两种方法结合成一种混合方法可以实现Web服务数据的正式表示,这将促进数据挖掘和基于机器学习的解决方案来处理这些数据。我们建立了基于语义fp树的技术来对Web服务的功能和非功能特征进行关联规则学习。Web服务的自动执行过程分两个步骤进行改进,即:(1)我们提供语义上形式化的日志,以维护有关服务消费者和Web服务过去交互的结构良好和形式化的信息;(2)对语义形式化的日志进行扩展关联规则挖掘,以发现任何可能的相关性,这些相关性可用于在Web服务自动排序和自适应过程中预过滤Web服务并减少搜索空间。我们进行了全面的评估,以证明我们建议的方法的效率、有效性和可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信