使用机器学习技术聚类和管理提供服务的数据

Zhangbing Zhou, M. Sellami, Walid Gaaloul, Bruno Defude
{"title":"使用机器学习技术聚类和管理提供服务的数据","authors":"Zhangbing Zhou, M. Sellami, Walid Gaaloul, Bruno Defude","doi":"10.1109/SKG.2011.9","DOIUrl":null,"url":null,"abstract":"In service-oriented computing, a user usually needs to locate a desired service for (i) fulfilling her requirements, or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the internet, locating a service online may not be appropriate from the performance perspective, especially in large internet-based service repositories. Instead, services usually need to be clustered offline according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Clustering and Managing Data Providing Services Using Machine Learning Technique\",\"authors\":\"Zhangbing Zhou, M. Sellami, Walid Gaaloul, Bruno Defude\",\"doi\":\"10.1109/SKG.2011.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In service-oriented computing, a user usually needs to locate a desired service for (i) fulfilling her requirements, or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the internet, locating a service online may not be appropriate from the performance perspective, especially in large internet-based service repositories. Instead, services usually need to be clustered offline according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly.\",\"PeriodicalId\":184788,\"journal\":{\"name\":\"2011 Seventh International Conference on Semantics, Knowledge and Grids\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Seventh International Conference on Semantics, Knowledge and Grids\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SKG.2011.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Seventh International Conference on Semantics, Knowledge and Grids","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKG.2011.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

在面向服务的计算中,用户通常需要找到所需的服务,以便(i)满足其需求,或(ii)替换由于某些原因消失或不可用的服务,以执行交互。随着企业内和互联网上可用服务数量的增加,从性能的角度来看,在线定位服务可能不合适,特别是在大型基于互联网的服务存储库中。相反,服务通常需要根据它们的相似性进行离线集群。因此,在动态服务发现期间,需要对一个或多个集群中的服务进行在线检查。在本文中,我们提出了一种改进的模糊c均值算法来聚类数据提供(DP)服务。在用向量表示DP服务时,我们考虑了DP服务元素之间的复合关系(即输入、输出和它们之间的语义关系)。DP服务向量按一定程度分配给一个或多个集群。将相似的服务分组到一个集群中,而将不同的服务划分到不同的集群中,可以显著提高服务搜索引擎的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering and Managing Data Providing Services Using Machine Learning Technique
In service-oriented computing, a user usually needs to locate a desired service for (i) fulfilling her requirements, or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the internet, locating a service online may not be appropriate from the performance perspective, especially in large internet-based service repositories. Instead, services usually need to be clustered offline according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信