Skip to content

A study to analyze and predict Election Outcome in Indian Politics using multiple machine-learning algorithms Decision Trees, Random Forests, SVM, and XGBoost with hyper parameters tuning (Grid search).

Notifications You must be signed in to change notification settings

srinithya-halaharvi/Analyzing_Predicting_Election_Outcomes_Indian_Politics

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Analyzing and Predicting Election Outcomes in Indian Politics

This project, employs data mining and machine learning techniques to unravel the complexities of electoral dynamics. It explores candidate attributes, party affiliations, and historical trends, enhancing predictive accuracy through algorithms like Decision Trees, Random Forests, SVM, and XGBoost with hyper parameter tuning(Grid Search). Noteworthy contributions include SVM optimization through grid search and a thorough comparative study of model performance. Visualizations shed light on the relationships between winning candidates and demographics. Acknowledging successes and limitations, the project navigates the challenges of model interpretability in political contexts, presenting a nuanced exploration of election prediction in Indian politics.

About

A study to analyze and predict Election Outcome in Indian Politics using multiple machine-learning algorithms Decision Trees, Random Forests, SVM, and XGBoost with hyper parameters tuning (Grid search).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published