MétaCan
Menu
Back to cohort
Record W2020650153 · doi:10.1109/ipdpsw.2013.69

Dataflow Oriented Similarity Matching for Scientific Workflows

2013· article· en· W2020650153 on OpenAlexafffund
Philip Yeo, Syed Sibte Raza Abidi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicScientific Computing and Data Management
Canadian institutionsDalhousie University
FundersCanarie
KeywordsWorkflowComputer scienceWorkflow technologyDataflowWorkflow engineMatching (statistics)Workflow management systemSimilarity (geometry)XPDLData miningSoftware engineeringDatabaseProgramming languageArtificial intelligence

Abstract

fetched live from OpenAlex

Duplicate and redundant workflows can be avoided by encouraging workflow reuse. In this paper, we present how workflow similarity matching approach can be used to further enhance existing workflow modeling tools. Most existing workflow similarity algorithms cater for control-flow oriented types of workflow which are typically associated with business workflows. The increase presence of scientific workflows that are mainly dataflow oriented calls for workflow similarity matching that caters for these types of workflows instead. We demonstrate here how our work of applying a behavioral analysis technique (taking into consideration the causal footprint of the workflow) that has been used for finding similarity in business workflows perform when use for scientific workflows. The distinction of our technique is the use of data provenance within the scientific workflow model where positional information of the workflow activities are taken in consideration in order to find matching workflow models. Preliminary experiments have shown that our proposed solution provides a viable alternative for matching scientific workflows within multiple scenarios. Furthermore, our suggested approach performs better, particularly with the removal and extension types of modification to the original workflow.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0040.004
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.176
GPT teacher head0.389
Teacher spread0.214 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2013
Admission routes2
Has abstractyes

Explore more

Same topicScientific Computing and Data ManagementFrench-language works237,207