Victor W. Chu, R. Wong, Wuhui Chen, Incheon Paik, Chi-Hung Chi
{"title":"基于客观和主观度量的服务发现","authors":"Victor W. Chu, R. Wong, Wuhui Chen, Incheon Paik, Chi-Hung Chi","doi":"10.1109/SCC.2013.33","DOIUrl":null,"url":null,"abstract":"Web services have become a primary mechanism for consuming resources available on the Internet. As more and more services are published on the Web, automated service discovery is critical to consumers to identify relevant and reliable services efficiently. In this paper, we enhance the Web Service Crawler Engine (WSCE) framework by introducing comparison measures to allow for more accurate identification, discovery and ranking of relevant Web services. To discover services effectively, we need to be able to measure and compare the similarity among services. Most ontology-based and IR-based discovery techniques assume that service input/output are simple data types when calculating service similarity. However, real-world services published on the Web usually have complex data types input/output parameters. Furthermore, a good match of parameters does not guarantee good usability and good reliability. The relevant services must be further evaluated by users' past experiences, based on both objective and subjective measures, to make optimal solution selection possible. This paper proposes a service matchmaking algorithm that considers the complex data types of service input/output parameters, as well as experience-based objective and subjective measures for ranking. Experiments show that our approach performs better than previous works that only consider simple data types.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Service Discovery Based on Objective and Subjective Measures\",\"authors\":\"Victor W. Chu, R. Wong, Wuhui Chen, Incheon Paik, Chi-Hung Chi\",\"doi\":\"10.1109/SCC.2013.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Web services have become a primary mechanism for consuming resources available on the Internet. As more and more services are published on the Web, automated service discovery is critical to consumers to identify relevant and reliable services efficiently. In this paper, we enhance the Web Service Crawler Engine (WSCE) framework by introducing comparison measures to allow for more accurate identification, discovery and ranking of relevant Web services. To discover services effectively, we need to be able to measure and compare the similarity among services. Most ontology-based and IR-based discovery techniques assume that service input/output are simple data types when calculating service similarity. However, real-world services published on the Web usually have complex data types input/output parameters. Furthermore, a good match of parameters does not guarantee good usability and good reliability. The relevant services must be further evaluated by users' past experiences, based on both objective and subjective measures, to make optimal solution selection possible. This paper proposes a service matchmaking algorithm that considers the complex data types of service input/output parameters, as well as experience-based objective and subjective measures for ranking. Experiments show that our approach performs better than previous works that only consider simple data types.\",\"PeriodicalId\":370898,\"journal\":{\"name\":\"2013 IEEE International Conference on Services Computing\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Services Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC.2013.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2013.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Service Discovery Based on Objective and Subjective Measures
Web services have become a primary mechanism for consuming resources available on the Internet. As more and more services are published on the Web, automated service discovery is critical to consumers to identify relevant and reliable services efficiently. In this paper, we enhance the Web Service Crawler Engine (WSCE) framework by introducing comparison measures to allow for more accurate identification, discovery and ranking of relevant Web services. To discover services effectively, we need to be able to measure and compare the similarity among services. Most ontology-based and IR-based discovery techniques assume that service input/output are simple data types when calculating service similarity. However, real-world services published on the Web usually have complex data types input/output parameters. Furthermore, a good match of parameters does not guarantee good usability and good reliability. The relevant services must be further evaluated by users' past experiences, based on both objective and subjective measures, to make optimal solution selection possible. This paper proposes a service matchmaking algorithm that considers the complex data types of service input/output parameters, as well as experience-based objective and subjective measures for ranking. Experiments show that our approach performs better than previous works that only consider simple data types.