A simple decomposition algorithm for support vector machines with polynomial-time convergence (Q885211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4256325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time decomposition algorithms for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a generalized SMO algorithm for SVM classifier design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to Platt's SMO Algorithm for SVM Classifier Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downlink beamforming for DS-CDMA mobile radio with multimedia services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank

Revision as of 19:55, 25 June 2024

scientific article
Language Label Description Also known as
English
A simple decomposition algorithm for support vector machines with polynomial-time convergence
scientific article

    Statements

    A simple decomposition algorithm for support vector machines with polynomial-time convergence (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2007
    0 references
    support vector machines
    0 references
    decomposition methods
    0 references
    convergence
    0 references
    statistical learning theory
    0 references
    pattern recognition
    0 references

    Identifiers