Abstract
The medoid-based clustering algorithm, Partition Around Medoids (PAM), is better than the centroid-based k-means because of its robustness to noisy data and outliers. PAM cannot recognize relatively small clusters in situations where good partitions around medoids clearly exist. Also PAM needs O(k(n-k)2) operations to cluster a given dataset, which is computationally prohibited for large nand k. In this paper, we propose a new bisecting k-medoids algorithm that is capable of grouping the co-expressed genes together with better clustering quality and time performances. The proposed algorithm is evaluated over three gene expression datasets in which noise components are involved. The proposed algorithm takes less computation time with comparable performance relative to the Partitioning Around Medoids algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have