This shows you the differences between two versions of the page.

Link to this comparison view

blogs:pub2010:discovering_process_models_with_genetic_algorithms_using_sampling [2011/05/03 12:37] (current)
Line 1: Line 1:
 +====== Discovering Process Models with Genetic Algorithms Using Sampling ======
 +C.C. Bratosin, N. Sidorova and W.M.P. van der Aalst\\
 +//In R. Setchi, I. Jordanov, R.J. Howlett & L.C. Jain (Eds.), Knowledge-Based and Intelligent Information and Engineering Systems (14th International Conference, KES'​2010,​ Cardiff, UK, September 8-10, 2010. Proceedings). (Lecture Notes in Computer Science, Vol. 6276, pp. 41-50). Berlin: Springer (DOI 10.1007/​978-3-642-15387-7_8)
 +=====Abstract =====
 +Process mining, a new business intelligence area, aims at discovering process models from event logs. Complex constructs, noise and infrequent behavior are issues that make process mining a complex problem. A genetic mining algorithm, which applies genetic operators to search in the space of all possible process models, deals with the aforementioned challenges with success. Its drawback is high computation time due to the high time costs of the fitness evaluation. Fitness evaluation time linearly depends on the number of process instances in the log. By using a sampling-based approach, i.e. evaluating fitness on a sample from the log instead of the whole log, we drastically reduce the computation time. When the desired fitness is achieved on the sample, we check the fitness on the whole log; if it is not achieved yet, we increase the sample size and continue the computation iteratively. Our experiments show that sampling works well even for relatively small logs, and the total computation time is reduced by 6 up to 15 times.
 +[[http://​alexandria.tue.nl/​campusonly/​Metis241852.pdf|Download PDF]] (368 KB)