Unsupervised learning algorithms applied to grouping problems
Author(s) -
Amelec Viloria,
Nelson Alberto Lizardo Zelaya,
Noel Varela
Publication year - 2020
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2020.07.099
Subject(s) - computer science , dbscan , cluster analysis , business process discovery , process mining , data mining , process (computing) , event (particle physics) , business process , unsupervised learning , identification (biology) , task (project management) , artificial intelligence , machine learning , business process modeling , algorithm , canopy clustering algorithm , correlation clustering , work in process , physics , botany , management , marketing , quantum mechanics , economics , business , biology , operating system
One of the tasks of great interest within process mining is the discovery of business process models, which consists of using an event log as input and producing a business process model by analyzing the data contained in the log and applying a process mining method, task and/or technique. The discovery allows the identification of the behaviors contained in the cases of the event log in order to detect possible deviations and/or validate that the business process is executed according to the business requirements. This paper presents an approach based on unsupervised learning techniques for the grouping of traces to generate simpler and more understandable models. The algorithms implemented for clustering are K-means, hierarchical agglomerative and density-based spatial clustering of applications with noise (DBSCAN).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom