Abstract

As a branch of frequent pattern mining, the task-oriented pattern mining has received increasing attention due to its broad application scenarios. The lexicographic subset tree based algorithm and the multiobjective evolutionary algorithm are two effective approaches for finding the most frequent and complete pattern in task-oriented applications. However, both suffer from heavy computational cost since their runtime increases rapidly as the transaction dataset is scaled up. To address this issue, this paper regards the task-oriented pattern mining as a data-driven optimization problem and solves it by using a surrogate-assisted multiobjective evolutionary algorithm. Based on the framework of our previous multiobjective evolutionary algorithm for task-oriented pattern mining, the proposed algorithm estimates the objective values of most solutions using an ensemble of surrogates instead of the real objective functions, thereby highly improving the efficiency of the algorithm. Experimental results on three task-oriented applications indicate that the proposed algorithm has better efficiency than state-of-the-art algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call