K-means is a clustering algorithm used in the field of unsupervised learning. The objective of the algorithm is to group a set of data into K clusters, where K is a predefined number of clusters. The algorithm starts by selecting K centroids at random and assigning each data point to the nearest centroid. Then, the algorithm recalculates the centroids as the average of all data points assigned to each centroid, and repeats the process of assigning and recalculating centroids until convergence is reached and the centroids no longer change position significantly. As a result, the data space is divided into K Voronoi cells (one per centroid), and each input observation can be associated with the nearest centroid. The K-means algorithm is widely used in customer segmentation, text classification and image processing, among other applications.
If you've ever wondered how Spotify recommends songs you like or how Siri and Alexa can understand what you say to them... the answer is that you can [...]
Read More »Hoy, 3 de octubre, hemos estado en los prestigiosos "Premios SCALEUPS B2B organizada por la Fundación Empresa y Sociedad, para hablaros de la Medici [...]
Read More »More and more companies are taking advantage of the relevant information they extract from the data they possess and generate to improve their processes and discover new ways to [...]
Read More »The integration of tools for predictive analytics is already commonplace in large companies, but thanks to the evolution and, above all, to the dem [...]
Read More »
