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

Nonsmooth optimization techniques for semisupervised classification.

Annabella Astorino1, Antonio Fuduli

  • 1Istituto di Calcolo e Reti ad Alte Prestazioni C.N.R., Dipartimento di Elettronica Informatica e Sistemistica, Università della Calabria, Italy. astorino@icar.cnr.it

IEEE Transactions on Pattern Analysis and Machine Intelligence
|October 16, 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

A Semiproximal Support Vector Machine Approach for Binary Multiple Instance Learning.

IEEE transactions on neural networks and learning systems·2020
Same author

Melanoma Detection by Means of Multiple Instance Learning.

Interdisciplinary sciences, computational life sciences·2019
Same author

A Lagrangian Relaxation Approach for Binary Multiple Instance Classification.

IEEE transactions on neural networks and learning systems·2019
Same author

The Proximal Trajectory Algorithm in SVM Cross Validation.

IEEE transactions on neural networks and learning systems·2016
Same author

Scaling up support vector machines using nearest neighbor condensation.

IEEE transactions on neural networks·2010
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 nonsmooth optimization for Transductive Support Vector Machine (TSVM) classification. The novel method effectively addresses challenges posed by nonconvex and nondifferentiable decision functions in binary classification tasks.

Area of Science:

  • Machine Learning
  • Optimization Theory
  • Computational Statistics

Background:

  • Classification problems often involve complex decision functions that are difficult to optimize.
  • Transductive Support Vector Machines (TSVM) are a powerful approach but can present nonconvex and nondifferentiable objective functions.
  • Minimizing these complex functions is crucial for accurate classification.

Purpose of the Study:

  • To develop and apply nonsmooth optimization techniques to classification problems.
  • To address the minimization challenges associated with nonconvex and nondifferentiable decision functions in TSVM.
  • To evaluate the efficacy of the proposed optimization method on standard binary classification datasets.

Main Methods:

  • Application of nonsmooth optimization algorithms.

Related Experiment Videos

  • Focus on Transductive Support Vector Machine (TSVM) framework.
  • Utilizing numerical simulations on established binary classification test problems.

    • Main Results:

    • Successful application of nonsmooth optimization to TSVM.
    • Demonstrated ability to handle nonconvex and nondifferentiable decision functions.
    • Positive numerical results on standard binary classification benchmarks.

    Conclusions:

    • Nonsmooth optimization provides a viable approach for tackling complex TSVM classification.
    • The proposed method offers an effective solution for minimizing difficult objective functions in machine learning.
    • The numerical results validate the practical utility of this technique for binary classification.