Pharmaceutical, Machine Learning, Graph Theory, Linear Programming.
product 1,2,3, etc. We leverage the KMeans clustering algorithm to identify the optimum number of clusters and bucket them. The elbow method helps us identify ‘5’ clusters to be the most optimal solution. npi_info['Sales']=np.nan for i in range(0,npi_info.shape[0]):