| Algorithm 1: Naive bayes (NB) | |
| Step | Processes involved |
| 1 | Start |
| 2 | Input: Training_Dataset(T) |
| 3 | F = (f1, f2, f3, ..., fn) // the predictor variables for testing items |
| 4 | Output: Class of testing items |
| 5 | Compute mean and standard deviation of predictor variables in each class |
| 6 | Repeat this step |
|
| (a) Compute probabilities required for the Bayesian theorem for Exiting employees |
|
| (b) Compute posterior probability of all those are not leaving the organization |
| 7 | Compute the likelihood of each class(first and second class) |
| 8 | Get the greatest likelihood |
| 9 | Return |