Author:
Gabissa Adugna Fita,Obsu Legesse Lemecha
Abstract
The main challenge in solving clustering problems using mathematical optimization techniques is the non-smoothness of the distance measure used. To overcome this challenge, we used Nesterov's smoothing technique to find a smooth approximation of the ℓ1 norm. In this study, we consider a bi-level hierarchical clustering problem where the similarity distance measure is induced from the ℓ1 norm. As a result, we are able to design algorithms that provide optimal cluster centers and headquarter (HQ) locations that minimize the total cost, as evidenced by the obtained numerical results.
Reference22 articles.
1. A new efficient algorithm based on DC programming and DCA for clustering;An;J Global Optimizat,2007
2. Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems;Bagirov;Pattern Recognit,2016
3. Derivative-free methods for unconstrained nonsmooth optimization and its numerical analysis;Bagirov;Investigacao Operacional,1999
4. Solving a continuous multifacility location problem by DC algorithms;Bajaj;Optimizat Meth Softw,2022
5. Solving the two-level clustering problem by hyperbolic smoothing approach, and design of multicast networks;Barbosa;The 13th World Conference on Transportation Research was organized on July 15–18, 2013 by COPPE - Federal University of Rio de Janeiro, Brazil,2013