
Finally, a Monte-Carlo exercise and an application to measure the e?ect of smoking during pregnancy on children's birth weights complete the paper. K-means and K-medoids clustering algorithms are widely used for many practical applications. Original k-mean and k-medoids algorithms select initial centroids and medoids randomly that affect the quality of the resulting clusters and sometimes it generates unstable and empty clusters which are meaningless. The original k-means and k-mediods algorithm is computationally expensive and requires time proportional to the product of the number of data items, number of clusters and the number of iterations.
The new approach for the k mean algorithm eliminates the deficiency of exiting k mean. It first calculates the initial centroids k as per requirements of users and then gives better, effective and stable cluster. It also takes less execution time because it eliminates unnecessary distance computation by using previous iteration. The new approach for k- medoids selects initial k medoids systematically based on initial centroids. It generates stable clusters to improve accuracy.
By Ritesh Kumar Pandey | Dr Asha Ambhaikar" Data Imputation Methods and Technologies" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-4 , June 2018,
URL: http://www.ijtsrd.com/papers/ijtsrd14113.pdf
Direct Link - http://www.ijtsrd.com/computer-science/real-time-computing/14113/data-imputation-methods-and-technologies/ritesh-kumar-pandey
indexed journal, peer reviewed international journal, open access journal of engineering
No comments:
Post a Comment