MétaCan
Menu
Back to cohort
Record W2907239237 · doi:10.1109/icebe.2018.00018

Towards a Process Analysis Approach to Adopt Robotic Process Automation

2018· article· en· W2907239237 on OpenAlexafffund
Abderrahmane Leshob, Audrey Bourgouin, Laurent Renard

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicBusiness Process Modeling and Analysis
Canadian institutionsUniversité du Québec à Montréal
FundersMitacs
KeywordsComputer scienceAutomationBusiness processProcess (computing)Context (archaeology)Process automation systemRobotDomain (mathematical analysis)Process managementOrder (exchange)Key (lock)SoftwareKnowledge managementRisk analysis (engineering)Software engineeringWork in processComputer securityArtificial intelligenceEngineeringBusinessOperations management

Abstract

fetched live from OpenAlex

Robotic Process Automation (RPA) is an emerging approach that automates repetitive human tasks using robots. For business processes, RPA refers to configuring software-based robots to do the work previously done by actors in the organizations. RPA offers many benefits including improved business efficiency, increased productivity, data security, reduced cycle time, and improved accuracy while allowing organizations to relieve their employees from repetitive and tedious tasks. However, implementing RPA represents a challenge and organizations must learn to manage RPA adoption to achieve maximum results. This paper aims to help organizations to effectively adopt RPA for automating their business processes. More precisely, it proposes a new method to guide organizations in analyzing their business processes in order to identify the most suitable for RPA. We present the principles underlying our method and the results obtained in the context of key processes from the banking domain.

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.005
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.008
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0050.003
Science and technology studies0.0020.003
Scholarly communication0.0060.006
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0030.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.025
GPT teacher head0.268
Teacher spread0.243 · 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 designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations101
Published2018
Admission routes2
Has abstractyes

Explore more

Same topicBusiness Process Modeling and AnalysisFrench-language works237,207