Traditional top-k query only returns the objects with largest k score, however, diversified top-k query concerns not only the score value but also the similarity of each object and remove all the redundant objects from results. According to [1]}, find top-k results falling into two categories: incremental manner and bounding manner. We noticed that the bounding manner first satisfied the k value, but in each step it may not add the largest score vertex. In our problem, we must maintain the largest information gain shapelets in order to have the best classification accuracy. So we calculate the diversified top-k shapelets via an incremental manner. The detailed search procedure is shown as in algorithm2.
