Results of K-means clustering for three different cleaning algorithms:TIME3D, TIME4D, and tail-cut. Ten cluster regions are estimated for each algorithm. This approach reduces the parameter space to ten per algorithm, with each cluster treated as a single point. For visualization, PCA is performed and the 14-dimensional parameter space is reduced to two components (Component 1 and Component 2).