Widened KRIMP: Better Performance through Diverse Parallelism

  title={Widened KRIMP: Better Performance through Diverse Parallelism},
  author={Oliver Sampson and Michael R. Berthold},
We demonstrate that the previously introduced Widening framework is applicable to state-of-the-art Machine Learning algorithms. Using Krimp, an itemset mining algorithm, we show that parallelizing the search finds better solutions in nearly the same time as the original, sequential/greedy algorithm. We also introduce Reverse Standard Candidate Order (RSCO) as a candidate ordering heuristic for Krimp.