A novel optimization approach towards improving separability of clusters (Q6164339): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A new efficient algorithm based on DC programming and DCA for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and efficient DCA based algorithms for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitional clustering via nonsmooth optimization. Clustering via optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental clustering algorithm based on hyperbolic smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for minimizing clustering functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast modified global \(k\)-means algorithm for incremental cluster construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with the average silhouette width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4516036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Separated Clusters and Optimal Fuzzy Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Passing Messages Between Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New diagonal bundle method for clustering problems in large data sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ward's hierarchical agglomerative clustering method: which algorithms implement Ward's criterion? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for solving the minimum sum-of-squares clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search approach for the minimum sum-of-squares clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hyperbolic smoothing clustering method / rank
 
Normal rank

Revision as of 14:03, 1 August 2024

scientific article; zbMATH DE number 7706555
Language Label Description Also known as
English
A novel optimization approach towards improving separability of clusters
scientific article; zbMATH DE number 7706555

    Statements

    A novel optimization approach towards improving separability of clusters (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    cluster analysis
    0 references
    incremental clustering
    0 references
    cluster validity indices
    0 references
    nonsmooth optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers