{"title":"Scientific Workflow Recommendation Based on Service Knowledge Graph","authors":"Jin Diao, Zhangbing Zhou","doi":"10.1109/ICBK50248.2020.00040","DOIUrl":null,"url":null,"abstract":"With the dramatically increasing emerging of external Web services, automatically creating workflows to satisfy the sophisticated requirements of users has become a significant issue. Most scientific workflow recommendation focus on mining association patterns between services in historical portfolios, including positive and negative rules, and recommending appropriate workflows based on derived patterns. However, due to the development of social network, several key social interactions are ignored which can enrich implicit associations of items and guide workflow recommendation. To tackle these problems, a Service Social Knowledge Graph (SSKG), including two types of entities service and developer and three types of relations isInk, isDlp and isFrd, is proposed to visually integrate and manage vital information which can facilitate workflows construction. Respectively, isInk shows the data flow between services, isDlp means the relation between a developer and his services and isFrd presents the friend relationships between developers. SSKG supplies indirect relations of services which inferred from isDlp and isFrnd. From SSKG, we extract several positive and negative rules to estimate the feasibility of composing services that the positive rules promote service composition and negative rules hinder the cooperation of services. According to the overall effects of rules, the $A^{*}$ and the Yen’s method are used to recommend workflows to users. We have conducted extensive experiments with real-world data. Results indicate that the accuracy and efficiency of our proposed method outperform the classical and state-of-the-art methods.","PeriodicalId":432857,"journal":{"name":"2020 IEEE International Conference on Knowledge Graph (ICKG)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK50248.2020.00040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
With the dramatically increasing emerging of external Web services, automatically creating workflows to satisfy the sophisticated requirements of users has become a significant issue. Most scientific workflow recommendation focus on mining association patterns between services in historical portfolios, including positive and negative rules, and recommending appropriate workflows based on derived patterns. However, due to the development of social network, several key social interactions are ignored which can enrich implicit associations of items and guide workflow recommendation. To tackle these problems, a Service Social Knowledge Graph (SSKG), including two types of entities service and developer and three types of relations isInk, isDlp and isFrd, is proposed to visually integrate and manage vital information which can facilitate workflows construction. Respectively, isInk shows the data flow between services, isDlp means the relation between a developer and his services and isFrd presents the friend relationships between developers. SSKG supplies indirect relations of services which inferred from isDlp and isFrnd. From SSKG, we extract several positive and negative rules to estimate the feasibility of composing services that the positive rules promote service composition and negative rules hinder the cooperation of services. According to the overall effects of rules, the $A^{*}$ and the Yen’s method are used to recommend workflows to users. We have conducted extensive experiments with real-world data. Results indicate that the accuracy and efficiency of our proposed method outperform the classical and state-of-the-art methods.
随着外部Web服务的急剧增加,自动创建工作流以满足用户的复杂需求已成为一个重要问题。大多数科学的工作流建议都侧重于挖掘历史投资组合中服务之间的关联模式,包括积极和消极规则,并基于派生模式推荐适当的工作流。然而,由于社会网络的发展,忽略了一些关键的社会互动,这些互动可以丰富项目的隐式关联,指导工作流推荐。针对这些问题,提出了一种服务社会知识图谱(Service Social Knowledge Graph, SSKG),包括服务和开发者两类实体以及isInk、isDlp和isFrd三种关系,以可视化的方式整合和管理重要信息,促进工作流的构建。isInk表示服务之间的数据流,isDlp表示开发人员与其服务之间的关系,isFrd表示开发人员之间的朋友关系。SSKG提供从isDlp和isFrnd推断的服务的间接关系。从SSKG中提取若干正反规则来估计组合服务的可行性,正反规则促进了服务组合,而正反规则阻碍了服务的合作。根据规则的整体效果,使用$A^{*}$和Yen的方法向用户推荐工作流。我们用真实世界的数据进行了大量的实验。结果表明,该方法的精度和效率优于经典方法和最先进的方法。