Corpus ID: 7774955

Graph n-grams for Scientific Workflow Similarity Search

@inproceedings{Wiegandt2016GraphNF,
  title={Graph n-grams for Scientific Workflow Similarity Search},
  author={D. Wiegandt and J. Starlinger and U. Leser},
  booktitle={LWDA},
  year={2016}
}
As scientific workflows increasingly gain popularity as a means of automated data analysis, the repositories such workflows are shared in have grown to sizes that require advanced methods for managing the workflows they contain. To facilitate clustering of similar workflows as well as reuse of existing components, a similarity measure for workflows is required. We explore a new structure-based approach to scientific workflow similarity assessment that measures similarity as the overlap in local… Expand

References

SHOWING 1-10 OF 21 REFERENCES
Alternative Approaches for Workflow Similarity
  • A. Wombacher, C. Li
  • Computer Science
  • 2010 IEEE International Conference on Services Computing
  • 2010
Efficient Graph Similarity Joins with Edit Distance Constraints
Efficient and Scalable Graph Similarity Joins in MapReduce
Fundamentals of control flow in workflows
...
1
2
3
...