AN INCREMENTAL NONSMOOTH OPTIMIZATION ALGORITHM FOR CLUSTERING USING L-1 AND L-infinity NORMS

ORDİN, BURAK; Bagirov, Adil; Mohebi, Ehsan

doi:10.3934/jimo.2019079

AN INCREMENTAL NONSMOOTH OPTIMIZATION ALGORITHM FOR CLUSTERING USING L-1 AND L-infinity NORMS

Atıf İçin Kopyala

ORDİN B. , Bagirov A., Mohebi E.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, cilt.16, ss.2757-2779, 2020 (SCI İndekslerine Giren Dergi)

Cilt numarası: 16 Konu: 6
Basım Tarihi: 2020
Doi Numarası: 10.3934/jimo.2019079
Dergi Adı: JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
Sayfa Sayıları: ss.2757-2779

Özet

An algorithm is developed for solving clustering problems with the similarity measure defined using the L-1 and L(infinity )norms. It is based on an incremental approach and applies nonsmooth optimization methods to find cluster centers. Computational results on 12 data sets are reported and the proposed algorithm is compared with the X-means algorithm.