Search of web service based on association rule

Lei Wang, Lingyu Xu, Jie Yu, Yunlan Xue, Gaowei Zhang, Xiangfeng Luo
{"title":"Search of web service based on association rule","authors":"Lei Wang, Lingyu Xu, Jie Yu, Yunlan Xue, Gaowei Zhang, Xiangfeng Luo","doi":"10.1109/ICCI-CC.2015.7259395","DOIUrl":null,"url":null,"abstract":"The rapid growth of web services need efficiently discovering the desired web services for the users. Web service interfaces are defined with WSDL that is described by a bag of terms. Many similarity metrics are proposed to solve this problem, it is hardly to resolve the problem that only few pairs of terms between two services have high semantic distance, the semantic distance of other terms between two services are low. Using traditional keyword search metrics may acquire a wrong result that these two web services are similar. But semantics of the web services is hardly to exploit. In this work we use association rule to find terms that are often appear together and find the most similar terms. We weaken the weight of the most similar term contained in an association rule and enhance the other terms' weight contained in an association rule to solve the situation above. The experiments show that our approach outperforms some searching methods.","PeriodicalId":328695,"journal":{"name":"2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCI-CC.2015.7259395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The rapid growth of web services need efficiently discovering the desired web services for the users. Web service interfaces are defined with WSDL that is described by a bag of terms. Many similarity metrics are proposed to solve this problem, it is hardly to resolve the problem that only few pairs of terms between two services have high semantic distance, the semantic distance of other terms between two services are low. Using traditional keyword search metrics may acquire a wrong result that these two web services are similar. But semantics of the web services is hardly to exploit. In this work we use association rule to find terms that are often appear together and find the most similar terms. We weaken the weight of the most similar term contained in an association rule and enhance the other terms' weight contained in an association rule to solve the situation above. The experiments show that our approach outperforms some searching methods.
基于关联规则的web服务搜索
web服务的快速增长需要有效地为用户发现所需的web服务。Web服务接口是用一组术语描述的WSDL定义的。为了解决这一问题,提出了许多相似度度量,但很难解决两个服务之间只有少数几对术语具有高语义距离,其他两个服务之间的术语语义距离都很低的问题。使用传统的关键字搜索指标可能会得到一个错误的结果,即这两个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学术官方微信