Projective Decomposition and Matrix Equivalence up to Scale
Max Robinson

TL;DR
This paper introduces projective decomposition, a normalization method for ratio-scale data matrices that preserves relative ratios and accounts for scale effects, providing a scale-invariant form unlike traditional z-transformation.
Contribution
It develops the theoretical framework of projective decomposition, defining scale-invariant forms and equivalence classes for matrices, enhancing normalization of ratio-scale data.
Findings
Defines projective decomposition and scale-invariant forms.
Shows equivalence classes of scaled matrices.
Provides a normalization method preserving ratios.
Abstract
A data matrix may be seen simply as a means of organizing observations into rows ( e.g., by measured object) and into columns ( e.g., by measured variable) so that the observations can be analyzed with mathematical tools. As a mathematical object, a matrix defines a linear mapping between points representing weighted combinations of its rows (the row vector space) and points representing weighted combinations of its columns (the column vector space). From this perspective, a data matrix defines a relationship between the information that labels its rows and the information that labels its columns, and numerical methods are used to analyze this relationship. A first step is to normalize the data, transforming each observation from scales convenient for measurement to a common scale, on which addition and multiplication can meaningfully combine the different observations. For example,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical and numerical algorithms · Neural Networks and Applications · Matrix Theory and Algorithms
