k-Means

Research output: Chapter or section in a book/report/conference proceedingChapter or section

171 Downloads (Pure)

Abstract

The k-means clustering algorithm (k-means for short) provides a method of
finding structure in input examples. It is also called the Lloyd–Forgy algorithm as it was independently introduced by both Stuart Lloyd and Edward Forgy. k-means, like other algorithms you will study in this part of the book, is an unsupervised learning algorithm and, as such, does not require labels associated with input examples. Recall that unsupervised learning algorithms provide a way of discovering some inherent structure in the input examples. This is in contrast with supervised learning algorithms, which require input examples and associated labels so as to fit a hypothesis function that maps input examples to one or more output variables.
Original languageEnglish
Title of host publicationIntroduction to Computational Intelligence
EditorsL. L. Minku, G. Cabral, M. Martins, M. wagner
PublisherIEEE Computational Intelligence Society
Chapter13
Pages179-190
DOIs
Publication statusPublished - Jan 2023

Fingerprint

Dive into the research topics of 'k-Means'. Together they form a unique fingerprint.

Cite this