International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 116 - Number 19 |
Year of Publication: 2015 |
Authors: Swapnali B. Sonawane, Ravi P. Patki |
10.5120/20447-2798 |
Swapnali B. Sonawane, Ravi P. Patki . Process Mining by using Event Logs. International Journal of Computer Applications. 116, 19 ( April 2015), 31-35. DOI=10.5120/20447-2798
Process mining techniques have usual notable attention within the literature for their ability to help within the redesign of complex processes by mechanically discovering models that specify the events registered in some log traces provided as input. Process mining refers to the extraction of process models from event logs. Now real-life processes tend to be less structured and a lot of flexible. Traditional process mining algorithms have issues dealing with such unstructured processes and generate "spaghetti-like" process models that are exhausting to understand. An approach to beat this is often to cluster process instances specified every of the ensuing clusters correspond to coherent sets of process instances which will every be adequately represented by a process model. To overcome these issues projected system aims to produce associate automatic means for code engineers to get mined models from systematic event logs specification embrace drawback finding, operating to learn others and technical challenge. This technique at first converts the Systematic Event Logs into some intermediate type like translated tokenized log file and keyword filtered log file. Then this filtered log file format is analyzed to extract the knowledge like Similarity matrix, Frequency count, Most read/write information, database queries and these event logs data measure accustomed build the clusters. Any system would generates the clusters using ActiTraC algorithm to produce refined description of generated models therefore incorrectness and additional overhead in analysis part of model development is removed to extended extent. This is supported on an repetitious, graded, refinement of the process model, where, at every step, traces sharing similar behavior patterns are clustered along and equipped with a specialized schema. The formula guarantees that every refinement results in an progressively sound model, so attaining a monotonic search.