Open Access
Subscription Access
Open Access
Subscription Access
Selecting Optimal Weighted Medoids for Clustering
Subscribe/Renew Journal
Clustering is the process of grouping data into clusters. Partitioning is an important clustering method. K-medoids is a classical partitioning method. K-medoids generates k clusters for a dataset of n objects using distance measure. But this algorithm may not be suitable for many real life applications. In addition to distance measure, the medoid selection may depend on many other factors in real life. A new weighted k-medoids algorithm is proposed in this paper to find optimal medoids using a new measure, weights of the medoids.
Keywords
K-Medoids, Weighted K-Medoids, Partitioning Clustering, SSE.
User
Subscription
Login to verify subscription
Font Size
Information
Abstract Views: 263
PDF Views: 2