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 SVM training algorithm with decomposition on very large data sets.

Jian-Xiong Dong, A Krzyzak, C Y Suen

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |March 30, 2005
    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

    n-Gram Statistics for Natural Language Understanding and Text Processing.

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

    A method for selecting constrained hand-printed character shapes for machine recognition.

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

    Application of a multilayer decision tree in computer recognition of chinese characters.

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

    Analysis and design of a decision tree based on entropy reduction and its application to large character set recognition.

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

    Large tree classifier with heuristic search and global training.

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

    A recursive thresholding technique for image segmentation.

    IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2008
    Same journal

    Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

    RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

    CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

    DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

    Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

    Learning Shape Anchors for Holistic Indoor Scene Understanding.

    IEEE transactions on pattern analysis and machine intelligence·2026
    See all related articles

    This study introduces an efficient algorithm for training large-scale support vector machines (SVMs). The method uses parallel optimization and matrix approximation, achieving linear time complexity and superior scalability for big data challenges.

    Area of Science:

    • Machine Learning
    • Computer Science

    Background:

    • Training support vector machines (SVMs) on large datasets with numerous classes presents significant computational challenges.
    • Existing methods struggle with scalability when dealing with high-dimensional data and a vast number of categories.

    Purpose of the Study:

    • To propose an efficient algorithm for training large-scale SVMs.
    • To address the limitations of current methods in handling massive datasets and thousands of classes.

    Main Methods:

    • Introduced a parallel optimization step to efficiently discard non-support vectors.
    • Employed block diagonal matrices to approximate the kernel matrix, enabling problem decomposition into smaller, manageable subproblems.
    • Integrated techniques like kernel caching and efficient kernel matrix computation to accelerate training.

    Related Experiment Videos

    Main Results:

    • The proposed algorithm exhibits linear time complexity concerning the number of classes and dataset size.
    • Demonstrated significantly better scaling capabilities compared to established SVM implementations like Libsvm, SVMlight, and SVMTorch.
    • Achieved strong generalization performance on several large-scale databases.

    Conclusions:

    • The developed algorithm offers an efficient and scalable solution for training SVMs on massive datasets.
    • The approach effectively handles problems with thousands of classes, outperforming existing state-of-the-art methods.
    • The algorithm's efficiency and generalization performance make it suitable for real-world large-scale machine learning applications.