Comparative Analysis on Dimension Reduction Algorithm of Principal Component Analysis and Singular Value Decomposition for Clustering

Clustering is a method of dividing datasets into several groups that have similarity or the same characteristics. High-dimensional Datasets will influence the effectiveness of the grouping process. This study compares two dimension reduction algorithms, namely Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) using K-Means clustering method to find out the best algorithm with the smallest Bouldin Davies Index evaluation. The dataset of this study involved public data from UCIMachine Learning which contains the number of weekly sales of a product. Data processing is performed by comparing the number of clusters from 3 to 10 and the dimension reduction from 2 to 10. From the data processing the RapidMiner tools, application with dimension reduction can provide better results than without dimension reduction. In particular, the PCA algorithm shows better results than the SVD, with which the best number of clusters is 5, and the number of dimensional reductions is 3 with a Bouldin Index of 0.376.