Jove
Visualize
Contact Us

Related Concept Videos

Survival Tree01:19

Survival Tree

208
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...
208
Reducing Line Loss01:18

Reducing Line Loss

242
In a three-phase circuit, line loss is an indicator of energy dissipated as heat due to the resistance of transmission lines. To address this, incorporating transformers into the system—a step-up transformer at the source and a step-down transformer at the load—is a strategic solution. Two three-phase transformers are introduced to improve this.
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
242
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

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

Cluster Sampling Method

13.5K
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...
13.5K
Trimmed Mean01:10

Trimmed Mean

3.1K
While measuring the mean of a data set, care needs to be taken when associating the mean to its central tendency. The same goes for the arithmetic mean, the geometric mean, or the harmonic mean. This is because the presence of a single outlier data value can significantly affect the mean. That is, the mean is sensitive to fluctuations in the data set.
Although certain measures of central tendency are not sensitive to outliers, there are alternative versions of the mean that get around the...
3.1K
Downsampling01:20

Downsampling

355
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
355

You might also read

Related Articles

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

Sort by
Same author

Federated Learning Via Inexact ADMM.

IEEE transactions on pattern analysis and machine intelligence·2023
Same author

Self-Distilled Hierarchical Network for Unsupervised Deformable Image Registration.

IEEE transactions on medical imaging·2023
Same author

Isoindigo-Thiophene D-A-D-Type Conjugated Polymers: Electrosynthesis and Electrochromic Performances.

International journal of molecular sciences·2023
Same author

Recursive Decomposition Network for Deformable Image Registration.

IEEE journal of biomedical and health informatics·2022
Same author

Support Vector Machine Classifier via L<sub>0/1</sub> Soft-Margin Loss.

IEEE transactions on pattern analysis and machine intelligence·2021
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Achieving Text-based Person Retrieval with Any Granularity.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles
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 Experiment Video

Updated: Nov 8, 2025

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

Sparse SVM for Sufficient Data Reduction.

Shenglong Zhou

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |April 23, 2021
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a fast Newton-type method for sparse Support Vector Machines (SVM) to reduce computational costs. The approach effectively controls support vectors, offering significant speed improvements for large datasets.

    More Related Videos

    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
    07:11

    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

    Published on: August 19, 2021

    2.7K
    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.8K

    Related Experiment Videos

    Last Updated: Nov 8, 2025

    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.9K
    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
    07:11

    ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

    Published on: August 19, 2021

    2.7K
    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.8K

    Area of Science:

    • Machine Learning
    • Computational Statistics

    Background:

    • Kernel-based Support Vector Machines (SVM) offer high performance but face computational challenges with large datasets.
    • Data reduction, specifically minimizing support vectors, is crucial for efficient SVM application.

    Purpose of the Study:

    • To develop a sparsity-constrained optimization method for kernel SVM.
    • To control the number of support vectors and enhance computational efficiency.

    Main Methods:

    • A Newton-type method is proposed, leveraging optimality conditions and stationary equations.
    • The method is designed to handle sparsity constraints in kernel SVM optimization.

    Main Results:

    • The developed method exhibits a one-step convergence property under specific starting conditions.
    • Demonstrates super-high computational speed, particularly for large-scale datasets.

    Conclusions:

    • The proposed sparsity-constrained kernel SVM method significantly reduces support vectors and computation time.
    • Outperforms existing solvers, especially for large-scale machine learning applications.