DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS
The process discovery as a major part of the process mining aims to produce a model from an event log. Event logs are a set of activities from business processes that have been executed and recorded in an Information System. The event log is currently used to analyze the current state of a company....
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/29783 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:29783 |
---|---|
spelling |
id-itb.:297832018-10-01T10:11:05ZDEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS Fitrianti Fahrudin - NIM: 23516007 , Nur Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/29783 The process discovery as a major part of the process mining aims to produce a model from an event log. Event logs are a set of activities from business processes that have been executed and recorded in an Information System. The event log is currently used to analyze the current state of a company. This is one of the goals of the process mining. However, the application of the process mining in the real world often has problems. Variants of a very large business process make the model produced by this process discovery difficult to understand. To deal with this problem a solution is proposed to partition or divide the event log into groups that have similarities. This method is known as sequence clustering. Sequence clustering is an additional process that is carried out before the process discovery is carried out. The implementation of sequence clustering is proven to be able to present the model produced by this process discovery to be simpler. <br /> <br /> <br /> <br /> In the previous research, First Order Markov Chain was used as a method for clustering. Each Cluster is represented by the transition matrix. Because the previous data cluster was not yet known, the researchers used the Expectation Maximization method to determine the transition matrix for each cluster. Each sequence is mapped into a cluster based on the highest probability value. However, after testing the clustering results, it was found that the fitness and precision values of the resulting process models often decreased, when compared to the process model that came from the event log that was not through the clustering process. Therefore this thesis developed a sequence clustering methodology that can improve fitness and precision values. <br /> <br /> <br /> <br /> The K-Means method is chosen as the method used to cluster. The application of K-Means in sequence clustering is able to increase the fitness and precision values of a model that results from the process discovery stage. However, determining the optimal number of clusters is important to note. Wrong in determining the number of clusters, can result in a decrease in the fitness value and precision of the resulting model. <br /> text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
The process discovery as a major part of the process mining aims to produce a model from an event log. Event logs are a set of activities from business processes that have been executed and recorded in an Information System. The event log is currently used to analyze the current state of a company. This is one of the goals of the process mining. However, the application of the process mining in the real world often has problems. Variants of a very large business process make the model produced by this process discovery difficult to understand. To deal with this problem a solution is proposed to partition or divide the event log into groups that have similarities. This method is known as sequence clustering. Sequence clustering is an additional process that is carried out before the process discovery is carried out. The implementation of sequence clustering is proven to be able to present the model produced by this process discovery to be simpler. <br />
<br />
<br />
<br />
In the previous research, First Order Markov Chain was used as a method for clustering. Each Cluster is represented by the transition matrix. Because the previous data cluster was not yet known, the researchers used the Expectation Maximization method to determine the transition matrix for each cluster. Each sequence is mapped into a cluster based on the highest probability value. However, after testing the clustering results, it was found that the fitness and precision values of the resulting process models often decreased, when compared to the process model that came from the event log that was not through the clustering process. Therefore this thesis developed a sequence clustering methodology that can improve fitness and precision values. <br />
<br />
<br />
<br />
The K-Means method is chosen as the method used to cluster. The application of K-Means in sequence clustering is able to increase the fitness and precision values of a model that results from the process discovery stage. However, determining the optimal number of clusters is important to note. Wrong in determining the number of clusters, can result in a decrease in the fitness value and precision of the resulting model. <br />
|
format |
Theses |
author |
Fitrianti Fahrudin - NIM: 23516007 , Nur |
spellingShingle |
Fitrianti Fahrudin - NIM: 23516007 , Nur DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
author_facet |
Fitrianti Fahrudin - NIM: 23516007 , Nur |
author_sort |
Fitrianti Fahrudin - NIM: 23516007 , Nur |
title |
DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
title_short |
DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
title_full |
DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
title_fullStr |
DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
title_full_unstemmed |
DEVELOPMENT OF SEQUENCE CLUSTERING ON PROCESS MINING FOR BUSINESS PROCESS ANALYSIS USING K-MEANS |
title_sort |
development of sequence clustering on process mining for business process analysis using k-means |
url |
https://digilib.itb.ac.id/gdl/view/29783 |
_version_ |
1822267224045387776 |