A randomized algorithm for two-cluster partition of a set of vectors (Q2354448): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sum of squares clustering in a low dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of the Euclidean Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-approximation algorithm for finding a clique with minimum weight of vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some cluster analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some data analysis problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of some problems of cluster analysis of vector sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of certain problems of searching for subsets of vectors and cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a search for a subset of ``similar'' vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation polynomial algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank

Revision as of 11:52, 10 July 2024

scientific article
Language Label Description Also known as
English
A randomized algorithm for two-cluster partition of a set of vectors
scientific article

    Statements

    A randomized algorithm for two-cluster partition of a set of vectors (English)
    0 references
    0 references
    0 references
    13 July 2015
    0 references
    partition
    0 references
    set of vectors
    0 references
    squared Euclidean distances
    0 references
    NP-hardness
    0 references
    randomized algorithm
    0 references
    asymptotic accuracy
    0 references

    Identifiers