Abstract
In this chapter, we will look at clustering algorithms or, as I like to call them, K-algorithms. Specifically, I’m referring to the K-nearest neighbor algorithm and the K-means algorithm. These algorithms are finding extensive use in classification systems and machine learning systems. These algorithms can become complex and mathematical. However, what we will do is look at the principles of these algorithms without the mathematical details of their implementation and simply use the concepts behind the mathematics to explain them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Armstrong Subero
About this chapter
Cite this chapter
Subero, A. (2020). Clustering Algorithms. In: Codeless Data Structures and Algorithms . Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-5725-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4842-5725-8_9
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-5724-1
Online ISBN: 978-1-4842-5725-8
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)