Upload README.md
Browse files
README.md
CHANGED
|
@@ -1,3 +1,181 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
---
|
| 2 |
-
|
| 3 |
-
|
|
|
|
| 1 |
+
# π§ Machine Learning Model Comparison β Classification Project
|
| 2 |
+
|
| 3 |
+
This project compares a variety of supervised machine learning algorithms to evaluate their performance on structured classification tasks. Each model was analyzed based on speed, accuracy, and practical usability.
|
| 4 |
+
|
| 5 |
+
## π Models Included
|
| 6 |
+
|
| 7 |
+
| **No.** | **Model Name** | **Type** |
|
| 8 |
+
|---------|----------------|----------|
|
| 9 |
+
| 1 | Logistic Regression | Linear Model |
|
| 10 |
+
| 2 | Random Forest | Ensemble (Bagging) |
|
| 11 |
+
| 3 | K-Nearest Neighbors | Instance-Based (Lazy) |
|
| 12 |
+
| 4 | Support Vector Machine | Margin-based Classifier |
|
| 13 |
+
| 5 | ANN (MLPClassifier) | Neural Network |
|
| 14 |
+
| 6 | Naive Bayes | Probabilistic |
|
| 15 |
+
| 7 | Decision Tree | Tree-based |
|
| 16 |
+
|
| 17 |
+
## π Accuracy Summary
|
| 18 |
+
|
| 19 |
+
| **Model** | **Accuracy (%)** | **Speed** |
|
| 20 |
+
|-----------|------------------|-----------|
|
| 21 |
+
| Logistic Regression | ~92.3% | π₯ Very Fast |
|
| 22 |
+
| Random Forest | ~87.2% | β‘ Medium |
|
| 23 |
+
| KNN | ~74.4% | π’ Slow |
|
| 24 |
+
| SVM | ~89.7% | β‘ Medium |
|
| 25 |
+
| ANN (MLP) | ~46.2% | β‘ Medium |
|
| 26 |
+
| Naive Bayes | ~82.1% | π Extremely Fast |
|
| 27 |
+
| Decision Tree | ~92.3% | π Fast |
|
| 28 |
+
|
| 29 |
+
## π§ Model Descriptions
|
| 30 |
+
|
| 31 |
+
### 1. **Logistic Regression**
|
| 32 |
+
* A linear model that predicts class probabilities using a sigmoid function.
|
| 33 |
+
* β
**Best for:** Interpretable and quick binary classification.
|
| 34 |
+
* β **Limitations:** Not ideal for non-linear or complex patterns.
|
| 35 |
+
* **Performance:** 92.3% accuracy with excellent precision-recall balance.
|
| 36 |
+
|
| 37 |
+
### 2. **Random Forest**
|
| 38 |
+
* An ensemble of decision trees with majority voting.
|
| 39 |
+
* β
**Best for:** Robust predictions and feature importance analysis.
|
| 40 |
+
* β **Limitations:** Slower and harder to interpret than simpler models.
|
| 41 |
+
* **Performance:** 87.2% accuracy with good generalization.
|
| 42 |
+
|
| 43 |
+
### 3. **K-Nearest Neighbors (KNN)**
|
| 44 |
+
* A lazy learner that predicts based on the nearest data points.
|
| 45 |
+
* β
**Best for:** Simple implementation and non-parametric classification.
|
| 46 |
+
* β **Limitations:** Very slow for large datasets; sensitive to noise.
|
| 47 |
+
* **Performance:** 74.4% accuracy, lowest among tested models.
|
| 48 |
+
|
| 49 |
+
### 4. **Support Vector Machine (SVM)**
|
| 50 |
+
* Separates classes by finding the maximum margin hyperplane.
|
| 51 |
+
* β
**Best for:** High-dimensional data and non-linear patterns with RBF kernel.
|
| 52 |
+
* β **Limitations:** Requires feature scaling; sensitive to hyperparameters.
|
| 53 |
+
* **Performance:** 89.7% accuracy with strong classification boundaries.
|
| 54 |
+
|
| 55 |
+
### 5. **ANN (MLPClassifier)**
|
| 56 |
+
* A basic feedforward neural network with hidden layers.
|
| 57 |
+
* β
**Best for:** Learning complex non-linear patterns.
|
| 58 |
+
* β **Limitations:** Poor performance in this project; needs better tuning and data preprocessing.
|
| 59 |
+
* **Performance:** 46.2% accuracy - severely underperformed, likely due to insufficient data scaling or architecture.
|
| 60 |
+
|
| 61 |
+
### 6. **Naive Bayes (GaussianNB)**
|
| 62 |
+
* A probabilistic classifier assuming feature independence.
|
| 63 |
+
* β
**Best for:** Fast training and text classification.
|
| 64 |
+
* β **Limitations:** Feature independence assumption rarely holds true.
|
| 65 |
+
* **Performance:** 82.1% accuracy with extremely fast training time.
|
| 66 |
+
|
| 67 |
+
### 7. **Decision Tree**
|
| 68 |
+
* A tree-based model that splits data based on feature thresholds.
|
| 69 |
+
* β
**Best for:** Interpretable rules and handling both numerical and categorical data.
|
| 70 |
+
* β **Limitations:** Prone to overfitting without proper pruning.
|
| 71 |
+
* **Performance:** 92.3% accuracy with excellent interpretability.
|
| 72 |
+
|
| 73 |
+
## π§ͺ Recommendation Summary
|
| 74 |
+
|
| 75 |
+
| **Best For** | **Model** |
|
| 76 |
+
|--------------|-----------|
|
| 77 |
+
| **Highest Accuracy** | Logistic Regression & Decision Tree (92.3%) |
|
| 78 |
+
| **Fastest Training** | Naive Bayes |
|
| 79 |
+
| **Best Interpretability** | Decision Tree |
|
| 80 |
+
| **Best Baseline** | Logistic Regression |
|
| 81 |
+
| **Most Robust** | Random Forest |
|
| 82 |
+
| **High-Dimensional Data** | SVM |
|
| 83 |
+
| **Needs Improvement** | ANN (MLPClassifier) |
|
| 84 |
+
|
| 85 |
+
## π Model Files Included
|
| 86 |
+
|
| 87 |
+
* π `logistic_regression.pkl` - Linear classification model
|
| 88 |
+
* π `random_forest_model.pkl` - Ensemble model
|
| 89 |
+
* π `KNeighborsClassifier_model.pkl` - Instance-based model
|
| 90 |
+
* π `SVM_model.pkl` - Support Vector Machine
|
| 91 |
+
* π `ANN_model.pkl` - Neural Network (needs optimization)
|
| 92 |
+
* π `Naive_Bayes_model.pkl` - Probabilistic model
|
| 93 |
+
* π `DecisionTreeClassifier.pkl` - Tree-based model
|
| 94 |
+
|
| 95 |
+
## π§ How to Use
|
| 96 |
+
|
| 97 |
+
### Loading and Using Models
|
| 98 |
+
|
| 99 |
+
```python
|
| 100 |
+
import joblib
|
| 101 |
+
from sklearn.preprocessing import StandardScaler
|
| 102 |
+
|
| 103 |
+
# Load any model
|
| 104 |
+
model = joblib.load("logistic_regression.pkl")
|
| 105 |
+
|
| 106 |
+
# For models requiring scaling (SVM, ANN)
|
| 107 |
+
scaler = StandardScaler()
|
| 108 |
+
X_scaled = scaler.fit_transform(X_new_data)
|
| 109 |
+
prediction = model.predict(X_scaled)
|
| 110 |
+
|
| 111 |
+
# For other models
|
| 112 |
+
prediction = model.predict(X_new_data)
|
| 113 |
+
print(prediction)
|
| 114 |
+
```
|
| 115 |
+
|
| 116 |
+
### Training Pipeline Example
|
| 117 |
+
|
| 118 |
+
```python
|
| 119 |
+
from sklearn.linear_model import LogisticRegression
|
| 120 |
+
from sklearn.preprocessing import StandardScaler
|
| 121 |
+
from sklearn.metrics import accuracy_score, classification_report
|
| 122 |
+
import joblib
|
| 123 |
+
|
| 124 |
+
# Data preprocessing
|
| 125 |
+
scaler = StandardScaler()
|
| 126 |
+
X_train_scaled = scaler.fit_transform(X_train)
|
| 127 |
+
X_test_scaled = scaler.transform(X_test)
|
| 128 |
+
|
| 129 |
+
# Model training
|
| 130 |
+
model = LogisticRegression(max_iter=1000)
|
| 131 |
+
model.fit(X_train_scaled, y_train)
|
| 132 |
+
|
| 133 |
+
# Save model
|
| 134 |
+
joblib.dump(model, 'logistic_regression.pkl')
|
| 135 |
+
|
| 136 |
+
# Evaluation
|
| 137 |
+
y_pred = model.predict(X_test_scaled)
|
| 138 |
+
accuracy = accuracy_score(y_test, y_pred)
|
| 139 |
+
print(f"Accuracy: {accuracy}")
|
| 140 |
+
print("Classification Report:\n", classification_report(y_test, y_pred))
|
| 141 |
+
```
|
| 142 |
+
|
| 143 |
+
## π Performance Details
|
| 144 |
+
|
| 145 |
+
### Confusion Matrix Analysis
|
| 146 |
+
Most models showed good precision-recall balance:
|
| 147 |
+
- **True Positives:** Models correctly identified positive cases
|
| 148 |
+
- **False Positives:** Low false alarm rates across top performers
|
| 149 |
+
- **Class Imbalance:** Dataset appears well-balanced between classes
|
| 150 |
+
|
| 151 |
+
### Key Insights
|
| 152 |
+
1. **Logistic Regression** and **Decision Tree** tied for best accuracy (92.3%)
|
| 153 |
+
2. **ANN** significantly underperformed - requires architecture optimization
|
| 154 |
+
3. **SVM** showed strong performance with RBF kernel
|
| 155 |
+
4. **Naive Bayes** offers best speed-accuracy tradeoff for quick prototyping
|
| 156 |
+
|
| 157 |
+
## π Future Improvements
|
| 158 |
+
|
| 159 |
+
### For ANN Model:
|
| 160 |
+
- Implement proper feature scaling
|
| 161 |
+
- Tune hyperparameters (learning rate, architecture)
|
| 162 |
+
- Add regularization techniques
|
| 163 |
+
- Consider ensemble methods
|
| 164 |
+
|
| 165 |
+
### General Optimizations:
|
| 166 |
+
- Cross-validation for robust performance estimates
|
| 167 |
+
- Hyperparameter tuning with GridSearch/RandomSearch
|
| 168 |
+
- Feature engineering and selection
|
| 169 |
+
- Ensemble methods combining top performers
|
| 170 |
+
|
| 171 |
+
## π Model Selection Guide
|
| 172 |
+
|
| 173 |
+
**Choose Logistic Regression if:** You need interpretability + high accuracy
|
| 174 |
+
**Choose Random Forest if:** You want robust predictions without much tuning
|
| 175 |
+
**Choose SVM if:** Working with high-dimensional or complex feature spaces
|
| 176 |
+
**Choose Decision Tree if:** Interpretability is crucial and you have domain expertise
|
| 177 |
+
**Choose Naive Bayes if:** Speed is critical and features are relatively independent
|
| 178 |
+
|
| 179 |
---
|
| 180 |
+
|
| 181 |
+
*For detailed performance metrics, confusion matrices, and visualizations, check the accompanying analysis files.*
|