MétaCan
Menu
Back to cohort
Record W2398381414 · doi:10.1504/ijbpim.2015.071262

An approach to extract RESTful services from web applications

2015· article· en· W2398381414 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Business Process Integration and Management · 2015
Typearticle
Languageen
FieldComputer Science
TopicWeb Data Mining and Analysis
Canadian institutionsPolytechnique MontréalQueen's University
Fundersnot available
KeywordsWorld Wide WebWeb serviceComputer science

Abstract

fetched live from OpenAlex

The web is the largest database with a huge amount of information and services primarily intended for human users. A user performs different tasks on the web, such as reserving a table in a restaurant. The reuse of web application components would offer greater productivity and ease the maintenance of web applications. The focus of this paper is to circumvent this limitation by proposing an approach to interactively identify reusable web tasks in a web application. We perform a case study on 21 real world web applications from four domains. We identify tasks and services from these web applications. Results show that our proposed approach can identify tasks correctly with a precision of 89% and a recall of more than 90%. Our proposed approach identifies relations among tasks with a precision of 86% and 100% recall. Our approach semi-automatically extracts reusable tasks and represent each task as a RESTful service.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score0.542

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.026
GPT teacher head0.303
Teacher spread0.278 · 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