期刊名称:IJAIN (International Journal of Advances in Intelligent Informatics)
印刷版ISSN:2442-6571
电子版ISSN:2548-3161
出版年度:2019
卷号:5
期号:2
页码:137-149
DOI:10.26555/ijain.v5i2.296
语种:English
出版社:Universitas Ahmad Dahlan
摘要: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.