Kernel-based identification using Lebesgue-sampled data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1223843 (Why is no real title available?)
- scientific article; zbMATH DE number 2048366 (Why is no real title available?)
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- A new kernel-based approach for linear system identification
- A new kernel-based approach to system identification with quantized output data
- Direct continuous-time approaches to system identification. Overview and benefits for practical applications
- Event-triggered identification of FIR systems with binary-valued output observations
- Identification Using Binary Measurements for IIR Systems
- Identification of Linear Models From Quantized Data: A Midpoint-Projection Approach
- Identification of linear dynamic systems using piecewise constant exitations: Use, misuse and alternatives
- Implementation of algorithms for tuning parameters in regularized least squares problems in system identification
- Iterative learning control for intermittently sampled data: monotonic convergence, design, and applications
- Kernel methods in system identification, machine learning and function estimation: a survey
- Kernel-based identification of asymptotically stable continuous-time linear dynamical systems
- Kernels for linear time invariant system identification
- On identification of FIR systems having quantized output data
- On the convergence properties of the EM algorithm
- On the estimation of transfer functions, regularizations and Gaussian processes-revisited
- Regularized system identification. Learning dynamic models from data
- The advantages of directly identifying continuous-time transfer function models in practical applications
- The normal law under linear restrictions: simulation and estimation via minimax tilting
- Tuning complexity in regularized kernel-based regression and linear system identification: the robustness of the marginal likelihood estimator
This page was built for publication: Kernel-based identification using Lebesgue-sampled data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550245)