Ontology learning with complex data type for Web service clustering

B. Kumara, Incheon Paik, K. Koswatte, Wuhui Chen
{"title":"Ontology learning with complex data type for Web service clustering","authors":"B. Kumara, Incheon Paik, K. Koswatte, Wuhui Chen","doi":"10.1109/CIDM.2014.7008658","DOIUrl":null,"url":null,"abstract":"Clustering Web services into functionally similar clusters is a very efficient approach to service discovery. A principal issue for clustering is computing the semantic similarity between services. Current approaches use similarity-distance measurement methods such as keyword, information-retrieval or ontology based methods. These approaches have problems that include discovering semantic characteristics, loss of semantic information and a shortage of high-quality ontologies. Further, current clustering approaches are considered only have simple data types in services' input and output. However, services that published on the web have input/ output parameter of complex data type. In this research, we propose clustering approach that considers the simple type as well as complex data type in measuring the service similarity. We use hybrid term similarity method which we proposed in our previous work to measure the similarity. We capture the semantic pattern exist in complex data types and simple data types to improve the ontology learning method. Experimental results show our clustering approach which uses complex data types in measuring similarity works efficiently.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2014.7008658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Clustering Web services into functionally similar clusters is a very efficient approach to service discovery. A principal issue for clustering is computing the semantic similarity between services. Current approaches use similarity-distance measurement methods such as keyword, information-retrieval or ontology based methods. These approaches have problems that include discovering semantic characteristics, loss of semantic information and a shortage of high-quality ontologies. Further, current clustering approaches are considered only have simple data types in services' input and output. However, services that published on the web have input/ output parameter of complex data type. In this research, we propose clustering approach that considers the simple type as well as complex data type in measuring the service similarity. We use hybrid term similarity method which we proposed in our previous work to measure the similarity. We capture the semantic pattern exist in complex data types and simple data types to improve the ontology learning method. Experimental results show our clustering approach which uses complex data types in measuring similarity works efficiently.
面向Web服务集群的复杂数据类型本体学习
将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学术官方微信