期刊:2020 2nd International Conference on Advances in Computing, Communication Control and Networking (ICACCCN)日期:2020-12-18卷期号:29: 32-35被引量:1
标识
DOI:10.1109/icacccn51052.2020.9362935
摘要
Because of its sensitivity towards initial medoids, the k medoid faces the limitation. So , in order to generate the optimized medoids, the proposed work consists of DK medoid algorithm, which helps us to get optimized medoids. The optimized medoids were produced in two steps, with the first step was to get mean of maximum and minimum values of each data set. The second step, then calculates D(decision) values and then the points with minimum d values were selected as initial medoids. The proposed work was calculated over a small real datasets and then the results of the proposed algorithm was compared with k medoids algorithm result. The proposed algorithm was found to be less time consuming than k medoids algorithm, thereby, reducing the time complexity.