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

Bandpass Sampling01:17

Bandpass Sampling

680
In signal processing, bandpass sampling is an effective technique for sampling signals that have most of their energy concentrated within a narrow frequency band. This type of signal is known as a bandpass signal. The key principle of bandpass sampling involves sampling the signal at a rate that is greater than twice the signal's bandwidth to prevent aliasing.
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2....
680
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

501
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....
501
Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

7.0K
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).
7.0K
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

4.3K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
4.3K
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

15.5K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
15.5K
Coefficient of Variation01:10

Coefficient of Variation

6.1K
The coefficient of variation measures the dispersion of the data points or distribution around the mean. Using the coefficient of variation, we can compare two data series with drastically different means or different units of measurement. The coefficient of variation for a sample and a population is expressed as a percentage of the ratio of standard deviation to the mean.
The coefficient of variation is a practical statistical tool in finance. It allows investors to assess the volatility or...
6.1K

You might also read

Related Articles

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

Sort by
Same author

MyGeneRisk Colon: A Web-Based Tool for Personalized Colorectal Cancer Risk Prediction Based on Genetics and Lifestyle.

medRxiv : the preprint server for health sciences·2026
Same author

OGTFinder: A Curated Growth Temperature Data Set and Its Application To Predict Optimal Growth Temperatures of Bacteria and Archaea.

Journal of chemical information and modeling·2026
Same author

Risk-based screening for early detection of colorectal cancer: an overview.

Best practice & research. Clinical gastroenterology·2026
Same author

Mixed-model and transcriptome-wide association analyses identify transcription factors and genes associated with colorectal cancer susceptibility.

Nature communications·2026
Same author

ADNEX-AI: automated extraction of ultrasound predictors for interpretable ovarian cancer risk stratification.

NPJ precision oncology·2025
Same author

A Novel Peak-Shape Aware Approach for Mass Alignment in Mass Spectrometry.

Rapid communications in mass spectrometry : RCM·2025
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Apr 28, 2026

A Method for Investigating Age-related Differences in the Functional Connectivity of Cognitive Control Networks Associated with Dimensional Change Card Sort Performance
09:01

A Method for Investigating Age-related Differences in the Functional Connectivity of Cognitive Control Networks Associated with Dimensional Change Card Sort Performance

Published on: May 7, 2014

9.5K

New bandwidth selection criterion for Kernel PCA: approach to dimensionality reduction and classification problems.

Minta Thomas1, Kris De Brabanter, Bart De Moor

  • 1KU Leuven, Department of Electrical Engineering (ESAT), STADIUS Center for Dynamical Systems, Signal Processing and Data Analytics/iMinds Medical IT, Kasteelpark Arenberg 10, 3001 Leuven, Belgium. minta.thomas@esat.kuleuven.be.

BMC Bioinformatics
|June 3, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces a novel, computationally efficient method for dimensionality reduction using Kernel PCA (KPCA) and Least Squares Support Vector Machines (LS-SVM) for improved cancer outcome prediction. The new approach offers faster processing times and comparable accuracy to existing techniques.

More Related Videos

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data
14:27

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data

Published on: June 26, 2013

15.2K
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

7.0K

Related Experiment Videos

Last Updated: Apr 28, 2026

A Method for Investigating Age-related Differences in the Functional Connectivity of Cognitive Control Networks Associated with Dimensional Change Card Sort Performance
09:01

A Method for Investigating Age-related Differences in the Functional Connectivity of Cognitive Control Networks Associated with Dimensional Change Card Sort Performance

Published on: May 7, 2014

9.5K
Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data
14:27

Identification of Disease-related Spatial Covariance Patterns using Neuroimaging Data

Published on: June 26, 2013

15.2K
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

7.0K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Medical Diagnostics

Background:

  • DNA microarrays are crucial for cancer diagnostics, treatment selection, and prognosis.
  • High-dimensional data from microarrays presents challenges for prediction models.
  • Dimensionality reduction techniques like feature selection and transformation are vital preprocessing steps.

Purpose of the Study:

  • To develop a computationally efficient bandwidth selection criterion for Kernel PCA (KPCA).
  • To propose a new prediction model integrating KPCA with Least Squares Support Vector Machine (LS-SVM).
  • To evaluate the performance of the proposed model against established methods for cancer outcome prediction.

Main Methods:

  • A novel data-driven bandwidth selection criterion for KPCA, linked to least squares cross-validation.
  • Integration of the optimized KPCA with LS-SVM for a new prediction model.
  • Comparative analysis using 9 case studies, evaluating Area Under the ROC Curve (AUC) and computational time.

Main Results:

  • The proposed KPCA bandwidth selection method is computationally less expensive than existing approaches.
  • The combined KPCA + LS-SVM model demonstrates competitive accuracy and reduced computational time.
  • Performance comparison showed the proposed strategy's efficiency against methods like PCA, t-test, PAM, and Lasso.

Conclusions:

  • Feature transformation and selection are effective for classification in medical diagnostics.
  • The proposed strategy offers a more efficient approach to dimensionality reduction for cancer outcome prediction.
  • The new method provides a practical advantage due to its reduced time complexity.