Sparse sensor placement optimization for classification
type: Item
instance of: scholarly article
zbMATH Open document ID: 1350.49037
DOI: 10.1137/15M1036713
author: B. W. Brunton
author: S. L. Brunton
author: J. L. Proctor
author: J. N. Kutz
published in: SIAM Journal on Applied Mathematics
publication date: 2016-10-28T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 49N30
Mathematics Subject Classification ID: 94A13
Mathematics Subject Classification ID: 94A20
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 6645043
zbMATH Keywords: sensor placement optimization
zbMATH Keywords: classification
zbMATH Keywords: compressed sensing
zbMATH Keywords: \(\ell_1\)-minimization
zbMATH Keywords: sparsity
zbMATH Keywords: feature selection
zbMATH Keywords: machine learning
zbMATH Keywords: image recognition
describes a project that uses: PRMLT
describes a project that uses: penalizedLDA
MaRDI profile type: Publication
cites work: Nonlinear model order reduction based on local reduced-order bases
cites work: A survey of projection-based model reduction methods for parametric dynamical systems
cites work: Q5483032
cites work: Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
cites work: Compressive Sensing and Low-Rank Libraries for Classification of Bifurcation Regimes in Nonlinear Dynamical Systems
cites work: Q5491042
cites work: Compressed sensing with coherent and redundant dictionaries
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Decoding by Linear Programming
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: Application of POD and DEIM on dimension reduction of non-linear miscible viscous fingering in porous media
cites work: For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
cites work: Compressed sensing
cites work: Pattern classification.
cites work: Compressive-Projection Principal Component Analysis
cites work: A note on the complexity of \(L _{p }\) minimization
cites work: Nonlinear Laplacian spectral analysis for time series with intermittency and low-frequency variability
cites work: High-Resolution Radar via Compressed Sensing
cites work: Turbulence, Coherent Structures, Dynamical Systems and Symmetry
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Cluster-based reduced-order modelling of a mixing layer
cites work: Mode‐Locked Soliton Lasers
cites work: Q5327097
cites work: A hierarchy of low-dimensional models for the transient and post-transient cylinder wake
cites work: Reduced order methods for modeling and computational reduction
cites work: Q5791409
cites work: Sparse dynamics for partial differential equations
cites work: Turbulence and the dynamics of coherent structures. I. Coherent structures
cites work: Algorithms for simultaneous sparse approximation. II: Convex relaxation
cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit
cites work: Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
cites work: Unsteady flow sensing and estimation via the gappy proper orthogonal decomposition
cites work: Penalized Classification using Fisher’s Linear Discriminant
full work available at URL: 15m1036713
OpenAlex ID: W2540556405
title: Sparse sensor placement optimization for classification
description: scientific article; zbMATH DE number 6645043