Clustering, multicollinearity, and singular vectors

08/07/2020
by   Hamid Usefi, et al.
0

Let A be a matrix with its pseudo-matrix A^† and set S=I-A^†A. We prove that, after re-ordering the columns of A, the matrix S has a block-diagonal form where each block corresponds to a set of linearly dependent columns. This allows us to identify redundant columns in A. We explore some applications in supervised and unsupervised learning, specially feature selection, clustering, and sensitivity of solutions of least squares solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2018

A Sherman-Morrison-Woodbury Identity for Rank Augmenting Matrices with Application to Centering

Matrices of the form A + (V_1 + W_1)G(V_2 + W_2)^* are considered where ...
research
07/24/2019

On the bias of H-scores for comparing biclusters, and how to correct it

In the last two decades several biclustering methods have been developed...
research
09/08/2020

A Distance-preserving Matrix Sketch

Visualizing very large matrices involves many formidable problems. Vario...
research
02/26/2019

A Feature Selection Based on Perturbation Theory

Consider a supervised dataset D=[A|b], where b is the outcome column, ro...
research
10/16/2018

Co-manifold learning with missing data

Representation learning is typically applied to only one mode of a data ...
research
09/21/2021

The influence of deflections on the static and dynamic behaviour of masonry columns

This paper studies the influence of bending deflections on the structura...
research
12/29/2016

Selecting Bases in Spectral learning of Predictive State Representations via Model Entropy

Predictive State Representations (PSRs) are powerful techniques for mode...

Please sign up or login with your details

Forgot password? Click here to reset