RiteshopShrivastava
Experienced Data Scientist worked on different projects like Electricity theft detection, NLP based RASA voice Bot, Face recognition, OCR etc.
Bhopal
Pinned Repositories
RiteshopShrivastava's Repositories
RiteshopShrivastava/Python
RiteshopShrivastava/Customer_Behavior_Analysis
RiteshopShrivastava/Energy-Prediction
RiteshopShrivastava/Assignment-1-Q11-Basic-Statistics-level-1
RiteshopShrivastava/Assignment-1-Q24-Basic-Statistics-level-1
RiteshopShrivastava/Gold-Price-forecasting
RiteshopShrivastava/Neural_Network
RiteshopShrivastava/Recommendation_sytem
RiteshopShrivastava/Support_Vector_Machine
RiteshopShrivastava/VOIP
RiteshopShrivastava/Assignment-2-Set-2-Q4-Basic-Statistics-level_2
RiteshopShrivastava/Assignment-2-Set-2-Q5-Basic-Statistics-level_2-
RiteshopShrivastava/Assignment-2-Set-4-Q3-Basic-Statistics-level-2
RiteshopShrivastava/Assignment-2-Set3-Q8-Q9-Basic-Statistics-level-2
RiteshopShrivastava/Association_rules
RiteshopShrivastava/Clustering_and_PCA
RiteshopShrivastava/Decision_tree
RiteshopShrivastava/Forecasting
RiteshopShrivastava/generative-ai-for-beginners
18 Lessons, Get Started Building with Generative AI 🔗 https://microsoft.github.io/generative-ai-for-beginners/
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)
RiteshopShrivastava/Hypothesis-Testing
RiteshopShrivastava/K_Nearest_Neighbors
RiteshopShrivastava/Logistic_Regression
RiteshopShrivastava/Multi_Linear_Regression
RiteshopShrivastava/Naive-Bayes
RiteshopShrivastava/OCR
RiteshopShrivastava/Random_Forest
RiteshopShrivastava/RiteshopShrivastava
RiteshopShrivastava/Simple_Linear_regression
Simple Linear Regression model
RiteshopShrivastava/TextMining