On the Towards Data Science blog , I have published a scientific article that deals with the handling of the Python package "kneed". In this article, the "kneed" underlying algorithm Kneedle is presented. It shows how to identify knee or elbow points (i.e., data points at which the function graph rises or falls the most) with Python in the best possible way. Based on the mathematical definition of curvature for continuous functions, Kneedle detects those beneficial data points showing the best balance inherent tradeoffs — called “knees” (curves that have negative concavity) or sometimes “elbows” (curves that have positive concavity) — in discrete data sets. Finally, useful application examples for the detection of knee or elbow points in Machine Learning are shown.
This repository contains the visualizations made for the kneed article on TDS. Identifying the "knee" or "elbow" point in a curve is a common problem in data science, where one needs to determine the optimal number of clusters or components to use in a model. The visualizations in this repository are designed to help users understand how the kneed algorithm works and how to interpret the results. The article can be read here.