NP-hardness of Euclidean sum-of-squares clustering (Q1009338): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/ml/AloiseDHP09, #quickstatements; #temporary_batch_1731543907597
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Pierre Hansen / rank
Normal rank
 
Property / author
 
Property / author: Pierre Hansen / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56500747 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: k-means++ / 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.1007/s10994-009-5103-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086959852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the single individual SNP haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsest cuts and bottlenecks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ml/AloiseDHP09 / rank
 
Normal rank

Latest revision as of 01:33, 14 November 2024

scientific article
Language Label Description Also known as
English
NP-hardness of Euclidean sum-of-squares clustering
scientific article

    Statements

    NP-hardness of Euclidean sum-of-squares clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    sum-of-squares clustering
    0 references
    complexity
    0 references

    Identifiers