Clustering and Spherical Visualization of Web Services

B. Kumara, Y. Yaguchi, Incheon Paik, Wuhui Chen
{"title":"Clustering and Spherical Visualization of Web Services","authors":"B. Kumara, Y. Yaguchi, Incheon Paik, Wuhui Chen","doi":"10.1109/SCC.2013.90","DOIUrl":null,"url":null,"abstract":"Web service clustering is one of a very efficient approach to discover Web services efficiently. Current clustering approaches use traditional clustering algorithms such as agglomerative as the clustering algorithm. The algorithms have not provided visualization of service clusters that gives inspiration for a specific domain from visual feedback and failed to achieve higher noise isolation. Furthermore iterative steps of algorithms consider about the similarity of limited number of services such as similarity of cluster centers. This leads to reduce the cluster performance. In this paper we apply a spatial clustering technique called the Associated Keyword Space(ASKS) which is effective for noisy data and projected clustering result from a three-dimensional (3D) sphere to a two dimensional(2D) spherical surface for 2D visualization. One main issue, which affects to the performance of ASKS algorithm is creating the affinity matrix. We use semantic similarity values between services as the affinity values. Most of the current clustering approaches use similarity distance measurement such as keyword, ontology and information-retrieval-based methods. These approaches have problem of short of high quality ontology and loss of semantic information. In this paper, we calculate the service similarity by using hybrid term similarity method which uses ontology learning and information retrieval. Experimental results show our clustering approach is able to plot similar services into same area and aid to search Web services by visualization of the service data on a spherical surface.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2013.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Web service clustering is one of a very efficient approach to discover Web services efficiently. Current clustering approaches use traditional clustering algorithms such as agglomerative as the clustering algorithm. The algorithms have not provided visualization of service clusters that gives inspiration for a specific domain from visual feedback and failed to achieve higher noise isolation. Furthermore iterative steps of algorithms consider about the similarity of limited number of services such as similarity of cluster centers. This leads to reduce the cluster performance. In this paper we apply a spatial clustering technique called the Associated Keyword Space(ASKS) which is effective for noisy data and projected clustering result from a three-dimensional (3D) sphere to a two dimensional(2D) spherical surface for 2D visualization. One main issue, which affects to the performance of ASKS algorithm is creating the affinity matrix. We use semantic similarity values between services as the affinity values. Most of the current clustering approaches use similarity distance measurement such as keyword, ontology and information-retrieval-based methods. These approaches have problem of short of high quality ontology and loss of semantic information. In this paper, we calculate the service similarity by using hybrid term similarity method which uses ontology learning and information retrieval. Experimental results show our clustering approach is able to plot similar services into same area and aid to search Web services by visualization of the service data on a spherical surface.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Web服务的聚类和球形可视化
Web服务集群是高效发现Web服务的一种非常有效的方法。目前的聚类方法采用传统的聚类算法,如agglomerative作为聚类算法。这些算法没有提供服务集群的可视化,无法从视觉反馈中为特定领域提供灵感,也无法实现更高的噪声隔离。此外,算法的迭代步骤考虑了有限数量服务的相似性,如聚类中心的相似性。这将导致集群性能降低。在本文中,我们应用了一种称为关联关键字空间(ASKS)的空间聚类技术,该技术对噪声数据和从三维(3D)球体到二维(2D)球面的投影聚类结果有效,用于二维可视化。影响ASKS算法性能的一个主要问题是关联矩阵的创建。我们使用服务之间的语义相似值作为亲和值。目前的聚类方法大多采用相似距离度量方法,如关键字、本体和基于信息检索的方法。这些方法存在缺乏高质量本体和语义信息丢失的问题。本文采用本体学习和信息检索相结合的混合术语相似度方法计算服务相似度。实验结果表明,我们的聚类方法能够将相似的服务绘制到同一区域,并通过在球面上可视化服务数据来帮助搜索Web服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
IoT Mashup as a Service: Cloud-Based Mashup Service for the Internet of Things Cloud Service Negotiation: A Research Roadmap Formal Modeling of Elastic Service-Based Business Processes Security-Aware Resource Allocation in Clouds Integrated Syntax and Semantic Validation for Services Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1