Determining The Number of Principal Components with Schur`s Theorem in Principal Component Analysis

Authors : Cihan KARAKUZULU, İbrahim Halil GÜMÜŞ, Serkan GÜLDAL, Mustafa YAVAŞ

Pages : 299-306

Doi:10.17798/bitlisfen.1144360

View : 36 | Download : 30

Publication Date : 2023-06-27

Article Type : Research Paper

Abstract :Principal Component Analysis is a method for reducing the dimensionality of datasets while also limiting information loss. It accomplishes this by producing uncorrelated variables that maximize variance one after the other. The accepted criterion for evaluating a Principal Component’s insert ignore into journalissuearticles values(PC); performance is λ_j/trinsert ignore into journalissuearticles values(S); where trinsert ignore into journalissuearticles values(S); denotes the trace of the covariance matrix S. It is standard procedure to determine how many PCs should be maintained using a predetermined percentage of the total variance. In this study, the diagonal elements of the covariance matrix are used instead of the eigenvalues to determine how many PCs need to be considered to obtain the defined threshold of the total variance. For this, an approach which uses one of the important theorems of majorization theory is proposed. Based on the tests, this approach lowers the computational costs.
Keywords : Principal Component Analysis, Majorization Theory, Schurs Theorem, Positive Semidefinite Matrices, Eigenvalues, Machine Learning