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 Experiment Videos

Fast sparse approximation for least squares support vector machine.

Licheng Jiao1, Liefeng Bo, Ling Wang

  • 1Institute of Intelligent Information Processing, Xi- ' ian University, Xi'an 710071, China.

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

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Wavelet spectral-aware Kolmogorov-Arnold Network for organ and tumor segmentation.

Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society·2026
Same author

Data and knowledge-driven imaging biomarkers for lumbar aging and degenerative risk stratification monitoring.

NPJ digital medicine·2026
Same author

Scale-Aware Prompting With Optimal Transport for Remote Sensing Image Captioning.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Learning Evolution Via Optimization Knowledge Adaptation.

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

DI3CL: Contrastive Learning With Dynamic Instances and Contour Consistency for SAR Land-Cover Classification Foundation Model.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Coarse-to-Fine Fusion: Customized Multiview Contrast Reinforcement Learning for Graph Clustering.

IEEE transactions on neural networks and learning systems·2026
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

Two new algorithms, FSALS-SVM and PFSALS-SVM, offer fast sparse approximations for least squares support vector machines (LS-SVM). These methods enable LS-SVM to handle large datasets efficiently without compromising generalization performance.

Area of Science:

  • Machine Learning
  • Computational Statistics

Background:

  • Least Squares Support Vector Machines (LS-SVM) are powerful but computationally expensive for large datasets.
  • Existing LS-SVM methods face scalability challenges, limiting their application in big data scenarios.

Purpose of the Study:

  • To develop fast sparse approximation schemes for LS-SVM.
  • To enhance the applicability of LS-SVM to large-scale machine learning problems.
  • To improve the testing speed and efficiency of LS-SVM classifiers.

Main Methods:

  • Introduced FSALS-SVM (Fast Sparse Approximation for LS-SVM) using iterative basis function addition from a kernel dictionary.
  • Implemented a flexible epsilon-insensitive stopping criterion for FSALS-SVM.
  • Developed PFSALS-SVM by incorporating a probabilistic speedup scheme to further accelerate FSALS-SVM.

Related Experiment Videos

Main Results:

  • FSALS-SVM and PFSALS-SVM achieve low complexity and produce sparse solutions.
  • The proposed algorithms demonstrate efficient handling of large benchmark datasets.
  • Sparse classifiers were obtained at a low computational cost, maintaining generalization performance.

Conclusions:

  • FSALS-SVM and PFSALS-SVM effectively address the scalability limitations of traditional LS-SVM.
  • These novel methods provide a computationally efficient and accurate approach for large-scale classification tasks.
  • The algorithms offer a practical solution for applying LS-SVM to big data challenges.