Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Linear Approximations

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...

Residuals and Least-Squares Property

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...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Linearization and Approximation

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...

Systems of Linear Equations in Two Variables

Systems of Linear Equations in Two Variables

Solving a system of linear equations is a fundamental concept in algebra. A system of equations consists of two or more linear equations involving the same set of variables. One of the most efficient algebraic methods for solving such systems is the substitution method. This technique involves expressing one variable in terms of the other from one equation and substituting it into the second equation. This method is particularly useful when one of the equations is easily rearranged.Consider the...

Distance Problem

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...

You might also read

Related Articles

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

Sort by

Same author

Sparsity-Aware Distributed Learning for Gaussian Processes With Linear Multiple Kernel.

IEEE transactions on neural networks and learning systems·2025

Same author

Aerodynamic Parameters in Byzantine Chant Voices: Comparisons Across Pitch and Loudness.

Journal of voice : official journal of the Voice Foundation·2024

Same author

Early soft and flexible fusion of electroencephalography and functional magnetic resonance imaging via double coupled matrix tensor factorization for multisubject group analysis.

Human brain mapping·2021

Same author

Enhanced design matrix for task-related fMRI data analysis.

NeuroImage·2021

Same author

Emojis influence autobiographical memory retrieval from reading words: An fMRI-based study.

PloS one·2020

Same author

Blind fMRI source unmixing via higher-order tensor decompositions.

Journal of neuroscience methods·2018

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

Search research articles

Related Experiment Videos

A geometric nearest point algorithm for the efficient solution of the SVM classification task.

Michael E Mavroforakis, Margaritis Sdralis, Sergios Theodoridis

IEEE Transactions on Neural Networks

|January 29, 2008

Summary

This summary is machine-generated.

This study introduces an efficient Support Vector Machine (SVM) classification method by integrating reduced convex hulls (RCHs) with a nearest point algorithm (NPA). The new approach demonstrates practical effectiveness for diverse real-world classification challenges.

Related Experiment Videos

Area of Science:

Machine Learning
Optimization
Computational Geometry

Background:

Support Vector Machine (SVM) classification is a key task in machine learning, with extensive research in both theory and applications.
Geometric methods offer intuitive and theoretically robust solutions for optimization problems, including SVM classification.

Discussion:

This work integrates recent advancements in reduced convex hulls (RCHs) with a nearest point algorithm (NPA).
This combination provides an elegant and efficient solution for SVM classification tasks.
The approach is validated on real-world problems, addressing linear/nonlinear and separable/nonseparable data.

Key Insights:

The novel RCH-NPA method offers an efficient solution for SVM classification.
The algorithm is effective across a range of classification complexities.
Encouraging practical results highlight its applicability to real-world datasets.

Outlook:

Further exploration of geometric methods in machine learning optimization.
Potential for broader applications of the RCH-NPA technique in data classification.
Advancements in efficient algorithms for complex machine learning problems.