Claim Missing Document
Check
Articles

Found 7 Documents
Search
Journal : Proceeding of the Electrical Engineering Computer Science and Informatics

A Combination of the Evolutionary Tree Miner and Simulated Annealing Afina Lina Nurlaili; Riyanarto Sarno
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (747.011 KB) | DOI: 10.11591/eecsi.v4.980

Abstract

In recent years, process mining is important to discover process model from event logs; however the existing methods have not achieved good in overall fitness.  In this context, this paper proposes a combination of the Evolutionary Tree  Miner (ETM) and Simulated Annealing (SA). The ETM aims to reduce randomness of population so that it can improved the quality of individuals. SA aims to increase overall fitness in the population. The results of the proposed method which  was compared to other approaches show that the proposes method had better in overall fitness and better quality of individuals.
Scalable Attack Analysis of Business Process based on Decision Mining Classification Dewi Rahmawati; Riyanarto Sarno
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (954.082 KB) | DOI: 10.11591/eecsi.v4.987

Abstract

Banking crime is one of the widespread phenomena in 2016 are closely associated with the used of computer-based technology and internet networks that constantly evolving. One of them is the burglary of customer accounts through the internet banking facility. To overcome this, we need a method of how to detect a conspiracy of bank burglary case of customer accounts. The way to scalable is by get a mining decision to get a decision tree and from the decision tree to get a decision attribute value to determine the level of anomalies. Then of all the attributes decision point is calculated rate of fraud. The rate of fraud is classified through level of security of attack by the attacker then entropy gain is used to calculate the relative effort between the level of attacks in the decision tree. The results show that the method could classify three levels of attacks and the corresponding entropy gains. The paper uses decision trees algorithm, alpha++ and dotted chart analysis to analyze an attack that can be scalable. The results of the analysis show that the accuracy achieved by 0.87%.
Scalability Measurement of Business Process Model Using Business Processes Similarity and Complexity Muhammad Ainul Yaqin; Riyanarto Sarno; Abd. Charis Fauzan
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (391.574 KB) | DOI: 10.11591/eecsi.v4.1033

Abstract

The scalability of business process model shows the ability of a system to handle the amount of provided   business   process   activity.   In   business process management, scalability is used to compare the size of a business process model to other business process models. This research focused on measuring the scalability of business process models. Every business  processes  were  modeled  using  Petri  Net. Petri Net was used as a business process model because of its simple model notation so it can be analyzed mathematically. The scalability of business processes had been done by comparing the similarity of some business processes and their scales. The similarity measurement method proposed were based on  structural  and  behavioral  using  Jaccard coefficient, whereas the number of elements of the business process model and control flow complexity were used to measure its scale. Then, the scale value (0..1) and the similarity of the business process model was calculated by the specified formula. The result is a scalability value where the greater the value of the scalability, then the growth potential of the business process is also greater.
Performance Measurement Based on Coloured Petri Net Simulation of Scalable Business Processes Abd. Charis Fauzan; Riyanarto Sarno; Muhammad Ainul Yaqin
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (327.621 KB) | DOI: 10.11591/eecsi.v4.1045

Abstract

Business process is also a complex area which receives much attention in recent years especially in increasing productivity and saving cost. Meanwhile, situation at the company allows existing business processes to be enlarged. This paper proposed the performance measurement based on coloured petri net simulation of scalable business processes, which has purpose to compare the performance of scalable business processes. For experiments, this paper uses real-world business processes. Then compare it to some business processes that have been enlarged. The result shows that scalable business processes influence the performance of business process. This paper provides feedback to business process developers for determine appropriate business processes based on the performance through coloured petri net simulation.
Optimizing Effort and Time Parameters of COCOMO II Estimation using Fuzzy Multi-objective PSO Kholed Langsari; Riyanarto Sarno
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (397.298 KB) | DOI: 10.11591/eecsi.v4.1047

Abstract

The  estimation  of  software  effort  is  an  essential and  crucial   activity   for  the  software   development   life  cycle. Software effort estimation is a challenge that often appears on the project of making a software. A poor estimate will produce result in a worse project management.  Various software cost estimation model has been introduced  to resolve this problem. Constructive Cost Model II (COCOMO II Model) create large extent most considerable  and broadly  used as model  for cost estimation.  To estimate   the  effort  and  the  development   time  of  a  software project,  COCOMO  II model uses cost drivers,  scale factors  and line  of  code.  However,  the  model  is  still  lacking  in  terms  of accuracy both in effort and development  time estimation.  In this study,   we   do   investigate   the   influence   of   components   and attributes to achieve new better accuracy improvement on COCOMO II model. And we introduced the use of Gaussian Membership  Function  (GMF)  Fuzzy  Logic  and Multi-Objective Particle Swarm Optimization method (MOPSO) algorithms in calibrating  and optimizing  the COCOMO  II model parameters. The   proposed   method   is   applied   on   Nasa93   dataset.   The experiment  result of proposed method able to reduce error down to  11.891%  and  8.082%  from  the  perspective  of  COCOMO  II model.  The  method  has  achieved  better  results  than  those  of previous   researches   and  deals  proficient   with  inexplicit   data input and further improve reliability of the estimation method.
Discovering Process Model from Event Logs by Considering Overlapping Rules Yutika Amelia Effendi; Riyanarto Sarno
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (363.404 KB) | DOI: 10.11591/eecsi.v4.1093

Abstract

Process Mining is a technique to automatically discover and analyze business processes from event logs. Discovering concurrent activities often uses process mining since there are many of them contained in business processes. Since researchers and practitioners are giving attention to the process discovery (one of process mining techniques), then the best result of  the  discovered process  models is  a  must. Nowadays, using process  execution  data in the  past, process  models with rules underlying decisions in processes can be enriched, called decision mining. Rules defined over process data specify choices between multiple activities. One out of multiple activities is allowed to be executed in existing decision mining methods or it is known as mutually-exclusive rules. Not only mutually-exclusive rules, but also fully deterministic because all factors which influence decisions are recorded. However, because of non-determinism or incomplete   information,   there   are   some   cases   that   are overlapping  in  process  model.  Moreover,  the  rules  which are generated  from  existing  method  are  not  suitable  with  the recorded data. In this paper, a discovery technique for process model with data by considering the overlapping rules from event logs is presented. Discovering overlapping rules uses decision tree learning techniques, which fit the recorded data better than the existing method. Process model discovery from event logs is generated using Modified Time-Based Heuristics Miner Algorithm. Last, online book store management process model is presented in High-level BPMN Process Model.
CHMM for Discovering Intentional Process Model From Event Logs by Considering Sequence of Activities Kelly R. Sungkono; Riyanarto Sarno
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (827.123 KB) | DOI: 10.11591/eecsi.v4.1094

Abstract

An intentional process model is known to analyze processes deeply and provide recommendations for the upcoming processes. Nevertheless, the discovery of intentions is a difficult task because the intentions are not recorded in the event log, but they encourage the executable activities in the event log. Map Miner is the latest algorithm to depict the intentional process model. A disadvantage of this algorithm is the inability to determine   strategies   that   contain   same   activities   with   the different sequence with other strategies. This disadvantage leads failure on the intentional process model. This research proposes an  algorithm for  discovering  an intentional  process  model  by considering the sequence of activities and CHMM (Coupled Hidden Markov Model). The probabilities and states of CHMM are utilized for the formation of the intentional process model. The experiment shows that the proposed algorithm with considering the sequence of activities gets an appropriate intentional process model. It also demonstrates that an obtained intentional  process  model  using  proposed  algorithm  gets  the better  validity  than  an  intentional  process  model  using  Map Miner Method.
Co-Authors A.A. Ketut Agung Cahyawan W ABDUL MUNIF ABDUL MUNIF Adhatus Solichah Ahmadiyah Adhatus Solichah Ahmadiyah, Adhatus Solichah Afina Lina Nurlaili Afrianda Cahyapratama Agung Wiratmo Agus Tri Haryono, Agus Tri Agus Zainal Arifin Ahmad Saikhu Ahmad Yusuf Ardiansyah Ahmadiyah, Adhatus Solichah Ainul Yaqin Alfian Ma’arif Alief Yoga Priyanto, Alief Yoga Andrean Hutama Koosasi Anggraini, Ratih Nur Esti Anto Satriyo Nugroho Ardy Januantoro Arifin, Mohammad Nazir Aziz Fajar Azzam Jihad Ulhaq Azzam Jihad Ulhaq Bagus Priambodo Bagus Setya Rintyarna Bambang Jokonowo Bayu Priyambadha Bilqis Amaliah Buliali, Joko Lianto Cahyaningtyas Sekar Wahyuni Chastine Fatichah Chastine Fatichah Chastine Fatihah Danica Virlianda Marsha Daniel Oranova Siahaan Dava Aulia Dedy Rahman Wijaya Dewi Rahmawati Dieky Adzkiya Dini Adni Navastra Dwi Sunaryo Dwi Sunaryono Dwo Sunaryono Edi Faisal Effendi, Yutika Amelia Endang Wahyu Pamungkas Faisal Rahutomo Faizal Anugrah Bhaswara Fajar, Aziz Farza Nurifan Fauzan Prasetyo Fauzan, Hermawan Feri Eko Herman Fernandes Sinaga Fika Hastarita Rachman Fony Revindasari Gabriel Sophia Gelu, Leonard Peter Gita Intani Budiawati HANA RATNAWATI Hendra Darmawan Hermawan Hermawan Hidayat, Husnul Hidayati, Shintami Chusnul Ida Ayu Putu Sri Widnyani Imam Cholissodin Imam Ghozali Imam Ghozali Imam Mukhlash Imam Riadi Ismail Eko Prayitno Rozi Isnaini Nurul Kurnia Sari Isnaini Nurul KurniaSari Jan Claes Johanes Andre Ridoean Joko Buliali Kartini Kartini Kelly Rosa Sungkono Kelly Rossa Sungkono Kholed Langsari Kholed Langsari Lailil Muflikhah Langsari, Kholed M. Jupri Margo Pudjiantara Mochammad Faris Ponighzwa Rizkanda Mohammad Fikri Mohammad Nazir Arifin Muhammad Ainul Yaqin Muhammad Nezar Mahardika Muhammad Nicko Rahmadano Muhammad Rivai Muhammad Taufiqulsa’di Muhammad Taufiqulsa’di Nashi Widodo Navinda Meutia Navinda Meutia Nurlaili, Afina Lina Nurul Fajrin Ariyani Nurul Fajrin Ariyani Peter Gelu Pradipta Ghusti Puji Budi Setia Asih Purwono, Purwono R.V Hari Ginardi Rachmad Abdullah Rachmad Abdullah Rahmawati, Dewi Ratih Nur Esti Anggraeni Ratih Nur Esti Anggraini Ratih Nur Esti Anggraini, Ratih Nur Esti Rizky Widhanto Herlambang Rosyid, Alfian Nur Ryco Puji Setyono Salsabila, Salsabila Sarwosri Sarwosri Setiaputra G, Riswandy Shintami Chusnul Hidayati Shintami Chusnul Hidayati Shintami Chusnul Hidayati Sholiq Sinarring Azi Laga Siti Maimunah Siti Maimunah Siti Rochimah Solichul Huda Suhariyanto Suhariyanto Suhariyanto Suhariyanto Sungkono, B.J. Santosa Tohari Ahmad Tyas, Salsabila Mazya Permataning Umi Salamah Untoro, Meida Cahyo Widya Nilam Rumana Widyasari Ayu Wibowo Yutika Amelia Zahrul Zizki Dinanto Zahrul Zizki Dinanto