 |
The K-medoids algorithm must specify k representative objects among the total objects. In this case, the value of n should be greater than the value of k. After that, after designating k objects, the object having the highest similarity becomes the center point. After that, after checking all objects other than those selected as center points, the cost between the existing center point object and all objects is calculated, and if the calculation result is negative, the center point is replaced. Repeat this process until there is no change.
|
IEEE/ICACT20220359 Slide.10
[Big Slide]
[YouTube]