Welcome to the Model-Ensembles-Boosting-In-Machine-Learning repository. This project demonstrates the implementation of various boosting methods using the Titanic Dataset, providing a comprehensive comparison of their performances.

1. Introduction
2. Dataset
3. Boosting Methods
   • Decision Tree
   • XGBoost
   • LightGBM
4. Installation
5. Usage
6. Example Results
7. License

Boosting is a powerful ensemble technique in machine learning that combines the predictions of several base estimators to improve robustness over a single estimator.

This repository explores:

• Boosting with XGBoost
• Boosting with LightGBM
• Boosting with Decision Tree

Each method is tested on the Titanic dataset to illustrate their effectiveness and performance differences.

The Titanic dataset is a famous dataset used in machine learning and statistics for binary classification. The goal is to predict whether a passenger survived the Titanic disaster based on features such as age, gender, class, etc.

• Boosting with Decision Tree

Decision Trees are simple yet powerful models. Here, we implement boosting with decision trees to enhance their performance by iteratively correcting the errors of the previous models.

• Boosting with XGBoost

XGBoost is an optimized distributed gradient boosting library designed to be highly efficient, flexible, and portable. It provides parallel tree boosting and is the leading machine learning library for regression, classification, and ranking problems.

• Boosting with LightGBM

LightGBM is a gradient boosting framework that uses tree-based learning algorithms. It is designed to be distributed and efficient with the following advantages:

• Faster training speed and higher efficiency
• Lower memory usage
• Better accuracy

To run the scripts and notebooks in this repository, ensure you have Python 3.x and the following libraries installed:

You can install these dependencies using pip:

'pip install numpy pandas matplotlib scikit-learn lightgbm xgboost'

1. Clone the repository
2. Open and run the Jupyter notebooks (*.ipynb) in your preferred environment. Each notebook demonstrates a specific boosting method.

Outputs and obtained results are only used for the dataset. If it uses another dataset, you will get other outputs.

1. Classification Report Comparison

• Accuracy: Overall accuracy of the model on the test set.
• Precision: Ability of the model to avoid false positives.
• Recall: Ability of the model to find all positive instances.
• F1-score: Harmonic mean of precision and recall.

Based on the evaluation of the classification reports and comparison among the algorithms, we observe varying performance across different metrics. Each algorithm shows strengths in different aspects of the classification task, with LightGBM and XGBoost generally outperforming AdaBoost on this dataset.

2. ROC

• The Receiver Operating Characteristic (ROC) curve is a graphical plot that illustrates the diagnostic ability of a binary classifier system as its discrimination threshold is varied. The curve is created by plotting the True Positive Rate (TPR) against the False Positive Rate (FPR) at various threshold settings.
• The area under the ROC curve (AUC) provides an aggregate measure of performance across all classification thresholds. An AUC of 1.0 represents a perfect model, while an AUC of 0.5 represents a model with no discrimination ability.

3. Confusion Matrix

• The Confusion Matrix is a table used to describe the performance of a classification model on a set of test data for which the true values are known. It shows the counts of true positive (TP), true negative (TN), false positive (FP), and false negative (FN) predictions.
• This matrix helps in understanding the types of errors the model is making and provides insights into the accuracy, precision, recall, and F1-score metrics.

This repository is licensed under the GNU General Public License (GPL) v3.0. See the LICENSE file for more details.