However, DTW is intrinsically gradual owing to its quadratic time complexity, which hampers its applicability in clustering. Consequently, TADPole produces an accurate answer faster, and then refines it till it converges to the exact reply. Moreover, the clustering algorithm solely requires two parameters, which makes it easy to make use