Asymmetric Web Service Operation Matching in Structural-Level Similarity Measure

He Lingjuan, Liu Lianchen, Wu Cheng
{"title":"Asymmetric Web Service Operation Matching in Structural-Level Similarity Measure","authors":"He Lingjuan, Liu Lianchen, Wu Cheng","doi":"10.1109/CIT.2008.WORKSHOPS.50","DOIUrl":null,"url":null,"abstract":"A structural-level Web service operation matching method with asymmetric characteristic is proposed in this paper. Our work focuses on the data-type matching based on XML schema, and the problem is a labeled tree edit distance calculation. We introduce the asymmetric characteristic of matching into the tree edit distance model and it can effectively improve the top-k precision of the fetching result set of operations.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A structural-level Web service operation matching method with asymmetric characteristic is proposed in this paper. Our work focuses on the data-type matching based on XML schema, and the problem is a labeled tree edit distance calculation. We introduce the asymmetric characteristic of matching into the tree edit distance model and it can effectively improve the top-k precision of the fetching result set of operations.
结构级相似性度量中的非对称Web服务操作匹配
提出了一种具有非对称特征的结构级Web服务操作匹配方法。我们的工作重点是基于XML模式的数据类型匹配,问题是标记树编辑距离的计算。在树编辑距离模型中引入匹配的非对称特征,可以有效提高操作获取结果集的top-k精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信