AN INCREMENTAL NONSMOOTH OPTIMIZATION ALGORITHM FOR CLUSTERING USING L-1 AND L-infinity NORMS
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Amer Inst Mathematical Sciences-Aims
Erişim Hakkı
info:eu-repo/semantics/openAccess
Ö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.
Açıklama
Anahtar Kelimeler
Nonsmooth optimization, nonconvex optimization, cluster analysis, unsupervised learning, incremental algorithm
Kaynak
Journal of Industrial and Management Optimization
WoS Q Değeri
Q3
Scopus Q Değeri
Cilt
16
Sayı
6
