A new maximum margin algorithm for one-class problems and its boosting implementation (Q1779737): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2004.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050025334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support vector data description / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Support of a High-Dimensional Distribution / 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: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary-norm separating plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming boosting via column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/15324430152748227 / rank
 
Normal rank

Revision as of 11:06, 10 June 2024

scientific article
Language Label Description Also known as
English
A new maximum margin algorithm for one-class problems and its boosting implementation
scientific article

    Statements

    A new maximum margin algorithm for one-class problems and its boosting implementation (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    One-class problems
    0 references
    Outliers
    0 references
    Statistical learning theory
    0 references
    Support vector machines
    0 references
    Margin
    0 references
    Boosting
    0 references

    Identifiers