Fast Data-Driven Greedy Sensor Selection for Ridge Regression

We propose a data-driven sensor-selection algorithm for accurate estimation of the target variables from the selected measurements. The target variables are assumed to be estimated by a ridge-regression estimator, which is trained based on the data. The proposed algorithm greedily selects sensors for minimizing the cost function of the estimator. Sensor selection that prevents overfitting of the resulting estimator can be realized by setting a positive regularization parameter. The greedy solution is computed in quite a short time by using some recurrent relations that we derive. The effectiveness of the proposed algorithm is verified for artificial datasets that are generated from linear systems and a real-wold dataset that is aimed for the selection of pressure-sensor locations for estimating the yaw angle of a ground vehicle. The demonstration for the datasets reveals that the proposed algorithm computes a sensor set, resulting in more accurate estimation than existing data-driven selection algorithms in some conditions. Furthermore, it is confirmed that setting a positive regularization parameter in the proposed algorithm leads to accurate estimation when overfitting is problematic.

Authors

Institutions

Publication Details

Journal
IEEE Sensors Journal
Published
2025-02-07
DOI
https://doi.org/10.1109/jsen.2025.3537702
Citations
4
Primary Topic
Fault Detection and Control Systems
Type
article
Field-Weighted Citation Impact
4.86
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast Data-Driven Greedy Sensor Selection for Ridge Regression

Yasuo Sasaki, Taku Nonomura, Keigo Yamada, Takayuki Nagata et al.
4 citations
IEEE Sensors Journal
Fault Detection and Control Systems
4.86
article

Fast Data-Driven Greedy Sensor Selection for Ridge Regression

Yasuo Sasaki, Taku Nonomura, Keigo Yamada, Takayuki Nagata, Yuji Saito
article en
4 citations

Abstract

We propose a data-driven sensor-selection algorithm for accurate estimation of the target variables from the selected measurements. The target variables are assumed to be estimated by a ridge-regression estimator, which is trained based on the data. The proposed algorithm greedily selects sensors for minimizing the cost function of the estimator. Sensor selection that prevents overfitting of the resulting estimator can be realized by setting a positive regularization parameter. The greedy solution is computed in quite a short time by using some recurrent relations that we derive. The effectiveness of the proposed algorithm is verified for artificial datasets that are generated from linear systems and a real-wold dataset that is aimed for the selection of pressure-sensor locations for estimating the yaw angle of a ground vehicle. The demonstration for the datasets reveals that the proposed algorithm computes a sensor set, resulting in more accurate estimation than existing data-driven selection algorithms in some conditions. Furthermore, it is confirmed that setting a positive regularization parameter in the proposed algorithm leads to accurate estimation when overfitting is problematic.

IEEE Sensors JournalVol. 25(6)
Tohoku University (JP), Nagoya University (JP)
Climate action
Openalex Percentile: Top 6%
Fault Detection and Control Systems
4.86
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.

Fast Data-Driven Greedy Sensor Selection for Ridge Regression — Yasuo Sasaki, Taku Nonomura, et al. · IEEE Sensors Journal (2025) | TGRS Research Map | TGRS