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

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...
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Prediction Intervals01:03

Prediction Intervals

The interval estimate of any variable is known as the prediction interval. It helps decide if a point estimate is dependable.
However, the point estimate is most likely not the exact value of the population parameter, but close to it. After calculating point estimates, we construct interval estimates, called confidence intervals or prediction intervals. This prediction interval comprises a range of values unlike the point estimate and is a better predictor of the observed sample value, y. 
The...
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...

You might also read

Related Articles

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

Sort by
Same author

Human-Like Multimodal Fake News Detection via Reflective Summarization and Large-Small Model Collaboration.

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

Hybrid graph attention learning with pseudo-label guided adaptive evolution.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Attribute-Topology Cross-Frequency Aligned Graph Neural Networks for Homophilic and Heterophilic Graphs in Node Classification.

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

Computational and Experimental Analysis of <i>Sophora alopecuroides</i> L. Chloroform Fraction: Active Components and Anti-Breast Cancer Resistance Mechanisms.

Molecules (Basel, Switzerland)·2026
Same author

Piezoelectric nanomotors for active cartilage regeneration of osteoarthritis via ultrasonic vibration and water splitting.

Biomaterials·2025
Same author

Multimodal Knowledge Graph Completion by Cross-Modal Interaction With Similarity Enhancing and Difference Embracing.

IEEE transactions on neural networks and learning systems·2025
Same journal

Exploiting audio-visual modalities in videos: Object detection via multi-stage bilateral coupling network.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Reliability-aware modality completion with cross-modal distillation for federated learning with missing modalities.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

IGFD-Net: Illumination-guided frequency decoupling for polarization image fusion.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Multiple-Strategies dung beetle optimizer and its applications in engineering optimization and bankruptcy prediction.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Aggregating global-scale pixel-wise forgery cues within a graph.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Finite-Time intermittent control for secure synchronization of Neutral-Type stochastic delayed neural networks under aperiodic DoS attacks.

Neural networks : the official journal of the International Neural Network Society·2026
See all related articles

Related Experiment Videos

Sparse kernel learning with LASSO and Bayesian inference algorithm.

Junbin Gao1, Paul W Kwan, Daming Shi

  • 1School of Computing and Mathematics, Charles Sturt University, Bathurst, NSW 2795, Australia. jbgao@csu.edu.au

Neural Networks : the Official Journal of the International Neural Network Society
|July 17, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel Bayesian approach for learning kernels within the Least Absolute Selection and Shrinkage Operator (LASSO) framework. The proposed algorithm efficiently generates sparse kernel models with improved computational performance.

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Statistical Modeling
  • Kernel Methods

Background:

  • Kernelized LASSO has been explored in recent literature.
  • Existing methods for sparse regression include Relevance Vector Machines (RVM) and Local Regularization Assisted Orthogonal Least Squares Regression (LROLS).

Purpose of the Study:

  • To develop a generative Bayesian learning and inference approach for learning kernels under the LASSO formulation.
  • To propose a new robust learning algorithm for sparse kernel models.

Main Methods:

  • Adopting a generative Bayesian learning and inference approach.
  • Developing a novel algorithm for learning regularized parameters and kernel hyperparameters.
  • Comparing the proposed method with RVM and LROLS.

Main Results:

  • The proposed algorithm produces a sparse kernel model.
  • The algorithm demonstrates capability in learning regularized parameters and kernel hyperparameters.
  • The new algorithm exhibits considerable computational advantages over existing methods.

Conclusions:

  • The proposed Bayesian learning approach offers an effective method for kernelized LASSO.
  • The algorithm provides a robust and computationally efficient solution for sparse kernel model construction.
  • This work advances sparse regression techniques through a novel kernel learning framework.