Fast Data-driven Greedy Sensor Selection for Ridge Regression

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 which 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 which are generated from linear systems and a real-wold dataset which are aimed for selection of pressure-sensor locations for estimating yaw angle of a ground vehicle. The demonstration for the datasets reveal that the proposed algorithm computes a sensor set resulting in more accurate estimation than existing data-drive 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.

References in corpus (26)

• Data-Driven Sparse Sensor Placement for Reconstruction
• On Submodularity and Controllability in Complex Dynamical Networks
• Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
• Near-Optimal Sensor Placement for Linear Inverse Problems
• Sensor Selection for Estimation with Correlated Measurement Noise
• Sensor placement by maximal projection on minimum eigenspace for linear inverse problems
• Determinant-based Fast Greedy Sensor Selection Algorithm
• Fast Greedy Optimization of Sensor Selection in Measurement with Correlated Noise
• A new approach for determining optimal placement of PM2.5 air quality sensors: case study for the contiguous United States
• Data-Driven Approach for Noise Reduction in Pressure-Sensitive Paint Data Based on Modal Expansion and Time-Series Data at Optimally Placed Points
• Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
• Data-driven sparse sensor placement based on A-optimal design of experiment with ADMM
• Data-driven Vector-measurement-sensor Selection based on Greedy Algorithm
• Data-Driven Optimal Sensor Placement for High-Dimensional System Using Annealing Machine
• Approximate Supermodularity of Kalman Filter Sensor Selection
• Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem
• Data-Driven Sensor Selection Method Based on Proximal Optimization for High-Dimensional Data With Correlated Measurement Noise
• Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments
• Spatiotemporal Superresolution Measurement based on POD and Sparse Regression applied to a Supersonic Jet measured by PIV and Near-field Microphone
• Seismic Wavefield Reconstruction based on Compressed Sensing using Data-Driven Reduced-Order Model
• Optimization of Sparse Sensor Placement for Estimation of Wind Direction and Surface Pressure Distribution Using Time-Averaged Pressure-Sensitive Paint Data on Automobile Model
• Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms
• Proof-of-concept Study of Sparse Processing Particle Image Velocimetry for Real Time Flow Observation
• Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
• Inadequacy of Linear Methods for Minimal Sensor Placement and Feature Selection in Nonlinear Systems; a New Approach Using Secants
• Observation Site Selection for Physical Model Parameter Estimation toward Process-Driven Seismic Wavefield Reconstruction