K Means Algorithm

  • Jo T
N/ACitations
Citations of this article
78Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter is concerned with the k means algorithm as the most popular clustering algorithm. This chapter begins with the unsupervised version of the KNN algorithm. With respect to the clustering process, we study the two main versions of the k means algorithm: the crisp k means algorithm and the fuzzy k means algorithm. The k medoid algorithm is mentioned as a variant of the k means algorithm, and the strategies of selecting representative items are focused. Note that the k means algorithm is the simplest version of EM algorithm, and it is covered in the next chapter.

Cite

CITATION STYLE

APA

Jo, T. (2021). K Means Algorithm. In Machine Learning Foundations (pp. 217–240). Springer International Publishing. https://doi.org/10.1007/978-3-030-65900-4_10

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