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.
We often wonder where Big Data is applied and we can assume a great relevance of Big Data for business. This explains the great in [....]
Read More »A few days ago we were able to attend a pioneering event in the world of Retail, the Retail Future 2022 fair. In its fifth edition, and under the slogan "Challenge [...]
Read More »Collecting debts, nowadays, is becoming an arduous task for many companies or freelancers. More and more banks, debt collection [...]
Read More »Credit scoring is a system used to rate credits and thus try to automate the decision making process at the time of purchasing a loan, and to [...]
Read More »
