|
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
|
| |
|
|
|
چکیده: (28477 مشاهده) |
| Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets. |
|
| |
|
|
متن کامل [PDF 1146 kb]
(38941 دریافت)
|
نوع مطالعه: پژوهشی |
دریافت: 1394/2/7 | پذیرش: 1394/3/26 | انتشار: 1394/6/25
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
