An Experimental Study of Dimension Reduction Methods on Machine Learning Algorithms with Applications to Psychometrics
원문 초록
Developing interpretable machine learning models has become an increasingly important issue. One way in which data scientists have been able to develop interpretable models has been to use dimension reduction techniques. In this paper, we examine several dimension reduction techniques including two recent approaches developed in the network psychometrics literature called exploratory graph analysis (EGA) and unique variable analysis (UVA). We compared EGA and UVA with two other dimension reduction techniques common in the machine learning literature (principal component analysis and independent component analysis) as well as no reduction to the variables real data. We show that EGA and UVA perform as well as the other reduction techniques or no reduction. Consistent with previous literature, we show that dimension reduction can decrease, increase, or provide the same accuracy as no reduction of variables. Our tentative results find that dimension reduction tends to lead to better performance when used for classification tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Manifold Learning with Normalizing Flows: Towards Regularity, Expressivity and Iso-Riemannian Geometry
Active Learning for Manifold Gaussian Process Regression
Distributed Lyapunov Functions for Nonlinear Networks
Leveraging Predictive Equivalence in Decision Trees
Deep Symmetric Autoencoders from the Eckart-Young-Schmidt Perspective
midr: Learning from Black-Box Models by Maximum Interpretation Decomposition
토론
이 논문과 연결된 포럼 글이 아직 없습니다.