Evidence map›Paper›PMID 35885132›Full record

ArticleEntropy (Basel, Switzerland)2022

PGraphD*: Methods for Drift Detection and Localisation Using Deep Learning Modelling of Business Processes.

Khadijah Muzzammil Hanga, Yevgeniya Kovalchuk, Mohamed Medhat Gaber

Open access · goldAbstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
0.1field-weighted citation impact, top 47% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed, 1 citations in OpenAlex.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 2 institutions in 2 countries.

Khadijah Muzzammil HangaSchool of Computing and Digital Technology, Birmingham City University, Birmingham B4 7XG, UK.ORCID 0000-0002-8358-1458
Yevgeniya KovalchukDepartment of Computer Science, University of Reading, Reading RG6 6DH, UK.ORCID 0000-0003-4306-4680
Mohamed Medhat GaberSchool of Computing and Digital Technology, Birmingham City University, Birmingham B4 7XG, UK.ORCID 0000-0003-0339-4474
Birmingham City University · GBUniversity of Reading · GB

Funding

Petroleum Technology Development Fund 1230
6 · The paper itself

Abstract

This paper presents a set of methods, jointly called PGraphD*, which includes two new methods (PGraphDD-QM and PGraphDD-SS) for drift detection and one new method (PGraphDL) for drift localisation in business processes. The methods are based on deep learning and graphs, with PGraphDD-QM and PGraphDD-SS employing a quality metric and a similarity score for detecting drifts, respectively. According to experimental results, PGraphDD-SS outperforms PGraphDD-QM in drift detection, achieving an accuracy score of 100% over the majority of synthetic logs and an accuracy score of 80% over a complex real-life log. Furthermore, PGraphDD-SS detects drifts with delays that are 59% shorter on average compared to the best performing state-of-the-art method.

Indexed as

business process managementconcept drift detectionconcept drift localisationdeep learninggraph streamslong short-term memoryprocess mining

Identifiers

PMID35885132
PMCPMC9324690
OpenAlexW4283765358

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.