K-Medoids Clustering Technique using Bat Algorithm

  • Sood M
  • Bansal S
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into different subset which is known as cluster. Cluster analysis is the data reduction toll for classifying a " mountain " of information into manageable meaningful piles. This method is vast research area in the field of data mining. In this paper, a partitioning clustering method that is K-Medoids algorithm is used with Bat algorithm. We proposed a new algorithm based on the echolocation behaviour of bats to know the initial value to overcome the K-Medoids issues. In this algorithm, we can find the initial representative object easily with the help of using Bat algorithm. They provide us better cluster analysis and we can achieve efficiency. This paper introduces the combination of K-Medoids clustering algorithm and Bat Algorithm. In this paper we show the difference between K-Medoid Clustering Technique with Bat Algorithm & K-medoid itself.

Cite

CITATION STYLE

APA

Sood, M., & Bansal, S. (2013). K-Medoids Clustering Technique using Bat Algorithm. International Journal of Applied Information Systems, 5(8), 20–22. https://doi.org/10.5120/ijais13-450965

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free