dc.contributor.author | KARAKUZULU, Cihan | |
dc.contributor.author | GÜMÜŞ, İbrahim Halil | |
dc.contributor.author | GÜLDAL, Serkan | |
dc.contributor.author | YAVAŞ, Mustafa | |
dc.date.accessioned | 2024-04-17T12:10:19Z | |
dc.date.available | 2024-04-17T12:10:19Z | |
dc.date.issued | 2023 | |
dc.identifier.issn | 2147-3188 | |
dc.identifier.uri | http://dspace.beu.edu.tr:8080/xmlui/handle/123456789/14806 | |
dc.description.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 (PC) performance is 𝜆�𝑗� 𝑡�𝑟�(𝑺�) where 𝑡�𝑟�(𝑺�) indicates the trace of the covariance matrix S. It is standard procedure to determine how many PCs should be maintained using a specified 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 computational costs. | tr_TR |
dc.language.iso | English | tr_TR |
dc.publisher | Bitlis Eren Üniversitesi | tr_TR |
dc.rights | info:eu-repo/semantics/openAccess | tr_TR |
dc.subject | Principal component analysis | tr_TR |
dc.subject | Majorization theory | tr_TR |
dc.subject | Schur’s theorem | tr_TR |
dc.subject | Positive semidefinite matrices | tr_TR |
dc.subject | Eigenvalues | tr_TR |
dc.title | Determining The Number of Principal Components with Schur's Theorem in Principal Component Analysis | tr_TR |
dc.type | Article | tr_TR |
dc.identifier.issue | 2 | tr_TR |
dc.identifier.startpage | 299 | tr_TR |
dc.identifier.endpage | 306 | tr_TR |
dc.relation.journal | Bitlis Eren Üniversitesi Fen Bilimleri Dergisi | tr_TR |
dc.identifier.volume | 12 | tr_TR |