结构级相似性度量中的非对称Web服务操作匹配

2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI:10.1109/CIT.2008.WORKSHOPS.50

He Lingjuan, Liu Lianchen, Wu Cheng

{"title":"结构级相似性度量中的非对称Web服务操作匹配","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":"{\"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}","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

摘要

提出了一种具有非对称特征的结构级Web服务操作匹配方法。我们的工作重点是基于XML模式的数据类型匹配，问题是标记树编辑距离的计算。在树编辑距离模型中引入匹配的非对称特征，可以有效提高操作获取结果集的top-k精度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Asymmetric Web Service Operation Matching in Structural-Level Similarity Measure

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 IEEE 8th International Conference on Computer and Information Technology Workshops

自引率

0.00%

发文量