An efficient algorithm for maximal margin clustering (Q656840): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural, Syntactic, and Statistical Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization-based approach for data classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization RLT-based approach for solving the hard clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization RLT-based approach for solving the fuzzy clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-plane clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank

Latest revision as of 20:47, 4 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for maximal margin clustering
scientific article

    Statements

    An efficient algorithm for maximal margin clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2012
    0 references
    maximum margin
    0 references
    clustering
    0 references
    unsupervised
    0 references
    SDP
    0 references

    Identifiers