Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
Calibration Curves: Linear Least Squares01:20

Calibration Curves: Linear Least Squares

A calibration curve is a plot of the instrument's response against a series of known concentrations of a substance. This curve is used to set the instrument response levels, using the substance and its concentrations as standards. Alternatively, or additionally, an equation is fitted to the calibration curve plot and subsequently used to calculate the unknown concentrations of other samples reliably.
For data that follow a straight line, the standard method for fitting is the linear...
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
Regression Toward the Mean01:52

Regression Toward the Mean

Regression toward the mean (“RTM”) is a phenomenon in which extremely high or low values—for example, and individual’s blood pressure at a particular moment—appear closer to a group’s average upon remeasuring. Although this statistical peculiarity is the result of random error and chance, it has been problematic across various medical, scientific, financial and psychological applications. In particular, RTM, if not taken into account, can interfere when researchers try to extrapolate results...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Semi-Supervised Deep Kernel Active Learning for Material Removal Rate Prediction in Chemical Mechanical Planarization.

Sensors (Basel, Switzerland)·2023
Same author

Center-Aware Adversarial Autoencoder for Anomaly Detection.

IEEE transactions on neural networks and learning systems·2021
Same author

A rapid integrated bioactivity evaluation system based on near-infrared spectroscopy for quality control of Flos Chrysanthemi.

Journal of pharmaceutical and biomedical analysis·2016
Same author

Chemomics-Integrated Proteomics Analysis of Jie-Geng-Tang to Ameliorate Lipopolysaccharide-Induced Acute Lung Injury in Mice.

Evidence-based complementary and alternative medicine : eCAM·2016
Same author

Deep Conditional Random Field Approach to Transmembrane Topology Prediction and Application to GPCR Three-Dimensional Structure Modeling.

IEEE/ACM transactions on computational biology and bioinformatics·2016
Same author

Combined spectroscopies and molecular docking approach to characterizing the binding interaction of enalapril with bovine serum albumin.

Luminescence : the journal of biological and chemical luminescence·2016
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Videos

Cutting plane method for continuously constrained kernel-based regression.

Zhe Sun1, Zengke Zhang, Huangang Wang

  • 1Department of Automation, Tsinghua University, Beijing, China. sun04@mails.thu.edu.cn

IEEE Transactions on Neural Networks
|December 17, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces novel methods for constrained kernel-based regression. The cutting plane method (CPM) and relaxed CPM (R-CPM) address computational challenges with continuous constraints, ensuring accurate and efficient regression results.

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Statistical Modeling
  • Optimization

Background:

  • Kernel-based regression is a powerful tool for predictive modeling.
  • Continuous constraints in regression problems often lead to computational difficulties.
  • Existing discretization methods for constraints in kernel regression have limitations in accuracy and scalability.

Purpose of the Study:

  • To develop effective methods for handling continuous constraints in kernel-based regression.
  • To propose a cutting plane method (CPM) that ensures strict adherence to original constraints.
  • To introduce a relaxed cutting plane method (R-CPM) for high-dimensional problems with computational efficiency.

Main Methods:

  • A novel cutting plane method (CPM) for iteratively discretizing continuous constraints.
  • A relaxed cutting plane method (R-CPM) designed for high-dimensional scenarios, allowing controlled constraint violation.
  • Implementation and validation through numerical experiments.

Main Results:

  • The proposed CPM strictly satisfies original continuous constraints in kernel-based regression.
  • The R-CPM achieves dimensional-independent computational complexity for high-dimensional problems.
  • Numerical experiments confirm the validity and effectiveness of both CPM and R-CPM.

Conclusions:

  • CPM and R-CPM offer robust solutions for constrained kernel-based regression.
  • These methods overcome limitations of prior discretization strategies.
  • The proposed approaches enhance the performance and applicability of kernel regression in complex scenarios.