A survey of graph-based algorithms for discovering business processes

Algorithms of process discovery help analysts to understand business processes and problems in a system by creating a process model based on a log of the system. There are existing algorithms of process discovery, namely graph-based. Of all algorithms, there are algorithms that process graph-databas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advances in intelligent informatics Jg. 5; H. 2; S. 137 - 149
Hauptverfasser: Sarno, Riyanarto, Sungkono, Kelly Rossa
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Yogyakarta Universitas Ahmad Dahlan 01.07.2019
Schlagworte:
Algorithms
Classification
Complexity
Diabetic retinopathy
Graph database
Mining
Performance measurement
Process discovery
Quality
Small & medium sized enterprises-SME
Survey
ISSN:2442-6571, 2442-6571
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Algorithms of process discovery help analysts to understand business processes and problems in a system by creating a process model based on a log of the system. There are existing algorithms of process discovery, namely graph-based. Of all algorithms, there are algorithms that process graph-database to depict a process model. Those algorithms claimed that those have less time complexity because of the graph-database ability to store relationships. This research analyses graph-based algorithms by measuring the time complexity and performance metrics and comparing them with a widely used algorithm, i.e. Alpha Miner and its expansion. Other than that, this research also gives outline explanations about graph-based algorithms and their focus issues. Based on the evaluations, the graph-based algorithm has high performance and less time complexity than Alpha Miner algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2442-6571
2442-6571
DOI:10.26555/ijain.v5i2.296