Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification (Q2654244)

From MaRDI portal
Revision as of 09:47, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification
scientific article

    Statements

    Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification (English)
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    0 references
    clustering
    0 references
    \(k\)-means
    0 references
    classification
    0 references
    linear-time complexity
    0 references
    support vector machines
    0 references
    \(k\)-nearest neighbor classifier
    0 references
    0 references
    0 references
    0 references
    0 references