AN INCREMENTAL NONSMOOTH OPTIMIZATION ALGORITHM FOR CLUSTERING USING L-1 AND L-infinity NORMS
Makaleler > Tam Makale · 2020
Yazarlar: Burak ORDİN, Adil Bagirov, Ehsan Mohebi
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, SCI Expanded İndekslerine Giren Dergi, Uluslararası, 2020, cilt 16, ss 2757-2779
DOI: 10.3934/jimo.2019079
Ö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.