|
A DC Optimization Algorithm for Clustering Problems with $𝑳_𝟏$-norm
|
| |
|
|
|
چکیده: (9296 مشاهده) |
| Clustering problems with the similarity measure defined by the $𝐿_1$-norm are studied. Characterizations of different stationary points of these problems are given using their difference of convex representations. An algorithm for finding the Clarke stationary points of the clustering problems is designed and a clustering algorithm is developed based on it. The clustering algorithm finds a center of a data set at the first iteration and gradually adds one cluster center at each consecutive iteration. The proposed algorithm is tested using large real world data sets and compared with other clustering algorithms. |
|
| |
|
|
متن کامل [PDF 1142 kb]
(16771 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Continuous Optimization
دریافت: 1397/3/7 | پذیرش: 1397/3/7 | انتشار: 1397/3/7
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
