To prevent spam users, you can only post on this forum after registration, which is by invitation. If you want to post on the forum, please send me a mail (h DOT m DOT w DOT verbeek AT tue DOT nl) and I'll send you an invitation in return for an account.

Comparision of execution time

Shital
Shital
edited March 2015 in Process Mining

Hi All,

I am relatively new to the topic. I am trying to compare the different Process Discovery algorithms. Which chapter of the book talks about "Execution time of an algorithm" ? I couldn't figure this out yet. Thanks in advance.

 

Regards,

Shital

Answers

  • fordanic
    fordanic

    Not sure that I understand what you mean by "Exectuion time of an algorithm". Are you referring to the time an algorithm need to process a certain log or the execution time of a certain trace?

  • Shital
    Shital

    Yes, that's correct

  • fordanic
    fordanic

    So, which one is it?

  • Shital
    Shital

    Oh sorry, my reply was abstract. I am looking for the time an algorithm needs to process a certain log. Are you aware of anything available in ProM

  • fordanic
    fordanic

    The only thing that I remember from the MOOC on process mining is that the genetic algorithm is very time consuming and should therefore only be used on small data sets. From my own experiance I also find that the ILP algorithm can be time and memory consuming.

Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Sign In Register

Categories

In this Discussion