Article Per Year (5 Year)
p-Index From 2020 - 2025
0.991
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Jurnal Teknik ITS Jurnal Sains dan Seni ITS Jurnal Penelitian Fisika dan Aplikasinya (JPFA) Jurnal Neutrino : jurnal fisika dan aplikasinya TELKOMNIKA (Telecommunication Computing Electronics and Control) Journal of Engineering and Technological Sciences International Journal of Advances in Intelligent Informatics Jurnal Geosaintek Jurnal Aplikasi Teknik Sipil Jurnal Elemen Indonesian Journal of Electrical Engineering and Computer Science
Sungkono, B.J. Santosa
Departemen Fisika Fakultas Matematika Dan Ilmu Pengetahuan Alam Institut Teknologi Sepuluh Nopember
Arts Humanities Astronomy Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Materials Science & Nanotechnology Physics

Published : 22 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : International Journal of Advances in Intelligent Informatics

 1 
A survey of graph-based algorithms for discovering business processes Riyanarto Sarno; Kelly Rossa Sungkono
International Journal of Advances in Intelligent Informatics Vol 5, No 2 (2019): July 2019
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v5i2.296

Abstract

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.
Co-Authors A.M Miftahul Huda Afrianda Cahyapratama Agung Wiratmo Agus Harianto Ahmadiyah, Adhatus Solichah Alwi Husein Arif Haryono Brillyano Agni Pradipta Cahyaningtyas Sekar Wahyuni Eden Lazuardi Fandi A. Fathoni Fungky Dyan Pertiwi Hendra Darmawan Imam Ghozali Irwan Setyowidodo, Bagus Jaya Santosa Kuntjoro, Kuntjoro Kusumastuti, Kusumastuti Latifatul Cholifah Masithoh N. Wasilah Nurul Mufidah Pramudiana Pramudiana R.R. Vienna Sona Saputri Soetadi Rachmad Abdullah Rapotan Saragih Rayhan Syauqiya Haf Ririn Ririn Riyanarto Sarno Rizky Akbar Pratama Sukobar, Sukobar Wildan M. Hidayatullah Yanur Arzaqa Ghiffari Yekti Widyaningrum