riteshopshrivastava / hierarchical_clustering

Unsupervised-ML---K-Means-Clustering-Non-Hierarchical-Clustering-Univ. Use Elbow Graph to find optimum number of clusters (K value) from K values range. The K-means algorithm aims to choose centroids that minimise the inertia, or within-cluster sum-of-squares criterion WCSS. Plot K values range vs WCSS to get Elbow graph for choosing K (no. of clusters)

Hi, I am Ritesh Shrivastava, A double Masters in Computer Application & Computer Science. Having 13+ years of diversified experience. I Believe, I am Good with Data Cleaning, Exploratory Data Analysis, Model Building, Deployement. Having Experience of working on projects in similar areas.

🔭 I’m currently working as Artificial Intelligence Developer for M.P. Government(Client side).

🌱 Having working knowledge of Machine Learning,Face Rrecognition,OCR,RASA framework,Voicebot,Voice over IP (VOIP),Python,Oracle, PosgreSQL,Excel, Operation Research etc..

👯 I’m looking to collaborate on Data Science concepts.

📫 U can reach me through [phone], mail : @[email protected]

Linkedin Profile -

Ritesh Shrivastava