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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SVMlight / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2009.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967259944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093255 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 2 July 2024

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