Author:
Diao Jin,Zhou Zhangbing,Xue Xiao,Zhao Deng,Chen Shengpeng
Abstract
Constructing a novel bioinformatic workflow by reusing and repurposing fragments crossing workflows is regarded as an error-avoiding and effort-saving strategy. Traditional techniques have been proposed to discover scientific workflow fragments leveraging their profiles and historical usages of their activities (or services). However, social relations of workflows, including relations between services and their developers have not been explored extensively. In fact, current techniques describe invoking relations between services, mostly, and they can hardly reveal implicit relations between services. To address this challenge, we propose a social-aware scientific workflow knowledge graph (S2KG) to capture common types of entities and various types of relations by analyzing relevant information about bioinformatic workflows and their developers recorded in repositories. Using attributes of entities such as credit and creation time, the union impact of several positive and negative links in S2KG is identified, to evaluate the feasibility of workflow fragment construction. To facilitate the discovery of single services, a service invoking network is extracted form S2KG, and service communities are constructed accordingly. A bioinformatic workflow fragment discovery mechanism based on Yen’s method is developed to discover appropriate fragments with respect to certain user’s requirements. Extensive experiments are conducted, where bioinformatic workflows publicly accessible at the myExperiment repository are adopted. Evaluation results show that our technique performs better than the state-of-the-art techniques in terms of the precision, recall, and F1.
Subject
Genetics (clinical),Genetics,Molecular Medicine
Reference46 articles.
1. Web service api recommendation for automated mashup creation using multi-objective evolutionary search;Almarimi;Appl. Soft Comput.,2019
2. Sr-lda: Mining effective representations for generating service ecosystem knowledge maps;Bai,20172017
3. A gravitation-based link prediction approach in social networks;Bastami;Swarm Evol. Comput.,2019
4. Latent Dirichlet allocation;Blei;J. Mach. Learn. Res.,2003
5. Fast unfolding of communities in large networks;Blondel;J. Stat. Mech.,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献