Extraction of linearly independent rows and dependency coefficients in datasets

This paper presents a constructive method for extracting a maximal set of linearly independent rows from a dataset matrix and computing explicit dependency coefficients for dependent rows. The proposed approach incrementally builds an independent subset by preserving linear independence at each step and subsequently derives the coefficient matrix expressing dependent rows as linear combinations of independent rows using a closed-form analytical expression based on the Gram matrix. Unlike classical rank-revealing techniques such as Gaussian elimination or singular value decomposition, which primarily identify independent components, the method directly provides explicit reconstruction relationships between dependent and independent rows. This enables structural analysis of redundancy within datasets and facilitates dimensionality reduction and feature selection. The mathematical formulation, algorithmic procedure, and numerical considerations are presented, demonstrating the effectiveness and interpretability of the approach.

Authors

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-03-20
DOI
https://doi.org/10.1051/e3sconf/202669905004/pdf
Primary Topic
Statistical and numerical algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extraction of linearly independent rows and dependency coefficients in datasets

Raphaël Sasportas
Springer Link (Chiba Institute of Technology)
Statistical and numerical algorithms
article

Extraction of linearly independent rows and dependency coefficients in datasets

Raphaël Sasportas
article en

Abstract

This paper presents a constructive method for extracting a maximal set of linearly independent rows from a dataset matrix and computing explicit dependency coefficients for dependent rows. The proposed approach incrementally builds an independent subset by preserving linear independence at each step and subsequently derives the coefficient matrix expressing dependent rows as linear combinations of independent rows using a closed-form analytical expression based on the Gram matrix. Unlike classical rank-revealing techniques such as Gaussian elimination or singular value decomposition, which primarily identify independent components, the method directly provides explicit reconstruction relationships between dependent and independent rows. This enables structural analysis of redundancy within datasets and facilitates dimensionality reduction and feature selection. The mathematical formulation, algorithmic procedure, and numerical considerations are presented, demonstrating the effectiveness and interpretability of the approach.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 10%
Statistical and numerical algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.