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

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...
Sensitivity, Specificity, and Predicted Value01:13

Sensitivity, Specificity, and Predicted Value

In healthcare diagnostics, laboratory tests play a crucial role in identifying and diagnosing a wide range of medical conditions. However, interpreting test results is not always straightforward. An abnormal test result does not always confirm the presence of a disease, just as a normal result does not guarantee its absence. To assess the reliability of these diagnostic tools, healthcare practitioners rely on two key statistical indicators: sensitivity and specificity.
Sensitivity is the...
Classification of Signals01:30

Classification of Signals

In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
End Point Prediction: Gran Plot01:07

End Point Prediction: Gran Plot

A Gran plot is used to predict the equivalence volume or endpoint of a potentiometric or acid-base titration without reaching the endpoint. Typically, titration data is collected as a function of the titrant's volume up to a point less than the equivalence volume and then transformed into a linear format. The straight line is extended to the x-axis, indicating the necessary titrant volume to achieve the equivalence point.
For potentiometric titration, the Gran plot is created by plotting the...
Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).
Survival Tree01:19

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a survival tree begins...

You might also read

Related Articles

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

Sort by
Same author

[The Impact of Donor Sex and Age on the Efficacy of Red Blood Cell Transfusion in Patients with Chronic Hematological Diseases].

Zhongguo shi yan xue ye xue za zhi·2026
Same author

Directional Charge Transfer in V-P-Ni 1D Chain for CO<sub>2</sub> Photoreduction and Mustard-Gas Simulant Detoxification.

Inorganic chemistry·2026
Same author

Development of a Competitive ELISA for Detecting Antibodies Against Pseudorabies Virus Glycoprotein D.

Transboundary and emerging diseases·2025
Same author

On-line identification of chemical constituents in Polygoni Multiflori Radix and Polygoni Multiflori Radix Praeparata based on UHPLC-Q-Orbitrap-Linear Ion Trap-MS.

BMC chemistry·2025
Same author

Three Distinct Iron-Doped POM-Based Hybrid Composites for the Hydroxylation of Benzene to Phenol.

Inorganic chemistry·2025
Same author

The neonatal Fc receptor (FcRn): Guardian or Trojan Horse in viral infection?

PLoS pathogens·2025
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 Video

Updated: Jun 2, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Feature selection using probabilistic prediction of support vector regression.

Jian-Bo Yang1, Chong-Jin Ong

  • 1Department of Mechanical Engineering, National University of Singapore, Singapore. yangjianbo@nus.edu.sg

IEEE Transactions on Neural Networks
|May 10, 2011
PubMed
Summary
This summary is machine-generated.

A novel feature selection technique for Support Vector Regression (SVR) enhances model performance by evaluating feature importance using probabilistic predictions. This method excels with sparse datasets, outperforming existing approaches.

More Related Videos

Generating the Transcriptional Regulation View of Transcriptomic Features for Prediction Task and Dark Biomarker Detection on Small Datasets
03:37

Generating the Transcriptional Regulation View of Transcriptomic Features for Prediction Task and Dark Biomarker Detection on Small Datasets

Published on: March 1, 2024

Related Experiment Videos

Last Updated: Jun 2, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Generating the Transcriptional Regulation View of Transcriptomic Features for Prediction Task and Dark Biomarker Detection on Small Datasets
03:37

Generating the Transcriptional Regulation View of Transcriptomic Features for Prediction Task and Dark Biomarker Detection on Small Datasets

Published on: March 1, 2024

Area of Science:

  • Machine Learning
  • Computational Statistics

Background:

  • Feature selection is crucial for optimizing regression models.
  • Support Vector Regression (SVR) is a powerful but computationally intensive regression technique.
  • Existing feature selection methods may not fully leverage SVR's predictive capabilities.

Purpose of the Study:

  • To introduce a new wrapper-based feature selection method for SVR.
  • To develop a feature importance measure based on probabilistic predictions.
  • To address the computational cost of exact importance calculation through approximations.

Main Methods:

  • A novel wrapper-based feature selection approach for SVR.
  • Feature importance calculation via aggregated differences in conditional density functions of SVR predictions.
  • Development and application of two computationally efficient approximations for the importance measure.

Main Results:

  • The proposed method demonstrates superior or comparable performance against existing SVR feature selection techniques.
  • Significant advantages were observed when applying the method to sparse datasets.
  • Experimental validation on both artificial and real-world datasets confirmed the method's effectiveness.

Conclusions:

  • The new feature selection method effectively enhances SVR performance, particularly for sparse data.
  • The proposed approximations provide a computationally viable alternative for calculating feature importance.
  • This work offers a valuable contribution to optimizing SVR models through advanced feature selection.