scientific article; zbMATH DE number 7416587

MaRDI QIDQ5160423zbMATH OpenFDO

Authors Tran Hung Cuong, Jen-Chih Yao, Nguyen Dong Yen

Publication date 28 October 2021

Full work available at URL http://yokohamapublishers.jp/online2/opjnca/vol20/p1591.html

zbMATH Keywords

convergenceDCAglobal solutionlocal solutionincremental algorithmthe \(k\)-means algorithmthe minimum sum-of-squares clustering problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Recommendations

• On some incremental algorithms for the minimum sum-of-squares clustering problem. II: Incremental DC algorithms
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• Approximation algorithms for min-sum \(p\)-clustering
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Less is more: simple algorithms for the minimum sum of squares clustering problem
• A scatter search approach for the minimum sum-of-squares clustering problem
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Approximation algorithms for clustering to minimize the sum of diameters

Cited in

(2)

• On some incremental algorithms for the minimum sum-of-squares clustering problem. II: Incremental DC algorithms
• An improved column generation algorithm for minimum sum-of-squares clustering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160423)