Clustering, multicollinearity, and singular vectors

DOI10.1016/j.csda.2022.107523OpenAlexW3047720159WikidataQ114191816 ScholiaQ114191816MaRDI QIDQ2143037

Hamid Usefi

Publication date: 30 May 2022

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.03368

zbMATH Keywords

clusteringsubset selectionmachine learningcollinearity

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Best subset selection via a modern optimization lens
• Particular formulae for the Moore--Penrose inverse of a columnwise partitioned matrix
• A new method for computing Moore-Penrose inverse matrices
• Relaxed Lasso
• Wrappers for feature subset selection
• Inverses of \(2\times 2\) block matrices
• Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
• Column subset selection is NP-complete
• Column subset selection problem is UG-hard
• On the Sensitivity of Solution Components in Linear Systems of Equations
• Numerical and Symbolic Computations of Generalized Inverses
• BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY
• 10.1162/153244303322753616
• Sparse Approximate Solutions to Linear Systems
• A polynomial algorithm for best-subset selection problem
• On the Sensitivity of Singular and Ill-Conditioned Linear Systems
• Fast matrix rank algorithms and applications
• Generalized Inverses of Partitioned Matrices
• Generalized Inversion of Modified Matrices

This page was built for publication: Clustering, multicollinearity, and singular vectors