Search Results - minimum-sum algorithm

Modified global k -means algorithm for minimum sum-of-squares clustering problems by Bagirov, Adil M.

“…k -Means algorithm and its variations are known to be fast clustering algorithms…”
Get full text

Parameterized algorithms for minimum sum vertex cover by Aute, Shubhada, Panolan, Fahad

“…)}. Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC is studied well in the realm of approximation algorithms…”
Get full text

Dual Threshold Self-Corrected Minimum Sum Algorithm for 5G LDPC Decoders by Chen, Rong, Chen, Lan

“… In order to meet the requirements of 5G communication, a dual threshold self-corrected minimum sum (DT-SCMS…”
Get full text

HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering by Gribel, Daniel, Vidal, Thibaut

“…•An efficient hybrid GA is proposed for minimum sum-of-squares (MSSC) clustering.•It finds higher-quality local minima than K-means and state-of-the-art algorithms…”
Get full text

Distributed random swap: An efficient algorithm for minimum sum-of-squares clustering by Kozbagarov, Olzhas, Mussabayev, Rustam

“…The clustering model known as Minimum Sum-of-Squares Clustering (MSSC) is widely used, with the popular k-means algorithm serving as its local minimizer…”
Get full text

A fast local search algorithm for minimum sum coloring problem on massive graphs by Li, Yan, Zhao, Mengyu, Zhang, Xindi, Wang, Yiyuan

“…The minimum sum coloring problem (MSCP) is an important extension of the graph coloring problem with wide real-world applications…”
Get full text

Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering by Zhou, Qing, Hao, Jin-Kao, Wu, Qinghua

“…) from a large set of data points. The balanced minimum sum-of-squares clustering problem is a variant of the classic minimum sum-of-squares clustering (MSSC…”
Get full text

High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data by Mussabayev, Ravil, Mussabayev, Rustam

“…This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD…”
Get full text

An Interior Point Algorithm for Minimum Sum-of-Squares Clustering by du Merle, O., Hansen, P., Jaumard, B., Mladenovic, N.

“…An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e…”
Get full text

An improved column generation algorithm for minimum sum-of-squares clustering by Aloise, Daniel, Hansen, Pierre, Liberti, Leo

“…Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC…”
Get full text

An exact algorithm for semi-supervised minimum sum-of-squares clustering by Piccialli, Veronica, Russo Russo, Anna, Sudoso, Antonio M.

“…The minimum sum-of-squares clustering (MSSC), or k-means type clustering, is traditionally considered an unsupervised learning task…”
Get full text

New and efficient DCA based algorithms for minimum sum-of-squares clustering by Hoai An, Le Thi, Hoai Minh, Le, Tao, Pham Dinh

“…) programming and DCA (DC Algorithm) to perform clustering via minimum sum-of-squares Euclidean distance…”
Get full text

A memetic algorithm for the Minimum Sum Coloring Problem by Jin, Yan, Hao, Jin-Kao, Hamiez, Jean-Philippe

“…Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors…”
Get full text

An exact algorithm for the minimum sum coloring problem on partially decomposable graphs by TAMMAL, Fatma, AÏDER, Méziane

“…Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) asks to find a legal vertex coloring of G…”
Get full text

A Self-Correcting Minimum Sum Algorithm with Dual Reliability by Wei, Zhaochuan, Zhou, Xiaoqian, Ji, Yuanfa, Inthaseone, Somsack

“…In order to improve the performance and reliability of Low-Density Parity-Check (LDPC) code decoding algorithms, this paper proposes a Self-Correcting Minimum Sum algorithm with Dual Reliability Determination…”
Get full text

Algorithms for the minimum sum coloring problem: a review by Jin, Yan, Hamiez, Jean-Philippe, Hao, Jin-Kao

“…The minimum sum coloring problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications…”
Get full text

A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems by Bagirov, Adil M., Yearwood, John

“…The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth, nonconvex optimization, and an algorithm for solving the former problem based on nonsmooth optimization techniques is developed…”
Get full text

A Spectrum Assignment Algorithm in Elastic Optical Network With Minimum Sum of Weighted Resource Reductions in all Associated Paths by Yuan, Junling, Zhu, Ruijie, Zhao, Yongli, Zhang, Qikun, Li, Xuhong, Zhang, Di, Samuel, Aretor

“… In this paper, we propose a spectrum assignment policy named minimizing sum of weighted resource reductions (min ΣwΔR) algorithm…”
Get full text

Threshold-based extended minimum-sum algorithm for non-binary LDPC codes by Ke Lai, Erbao Li, Jing Lei

“…In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large…”
Get full text

A heuristic algorithm for solving the minimum sum-of-squares clustering problems by Ordin, Burak, Bagirov, Adil M.

“… Various heuristics were developed to solve the clustering problem. The global k -means and modified global k -means are among most efficient heuristics for solving the minimum sum-of-squares clustering problem…”
Get full text