| Literature DB >> 35241760 |
Kyle Lam1, Junhong Chen1, Zeyu Wang1, Fahad M Iqbal1, Ara Darzi1, Benny Lo1, Sanjay Purkayastha2, James M Kinross1.
Abstract
Accurate and objective performance assessment is essential for both trainees and certified surgeons. However, existing methods can be time consuming, labor intensive, and subject to bias. Machine learning (ML) has the potential to provide rapid, automated, and reproducible feedback without the need for expert reviewers. We aimed to systematically review the literature and determine the ML techniques used for technical surgical skill assessment and identify challenges and barriers in the field. A systematic literature search, in accordance with the PRISMA statement, was performed to identify studies detailing the use of ML for technical skill assessment in surgery. Of the 1896 studies that were retrieved, 66 studies were included. The most common ML methods used were Hidden Markov Models (HMM, 14/66), Support Vector Machines (SVM, 17/66), and Artificial Neural Networks (ANN, 17/66). 40/66 studies used kinematic data, 19/66 used video or image data, and 7/66 used both. Studies assessed the performance of benchtop tasks (48/66), simulator tasks (10/66), and real-life surgery (8/66). Accuracy rates of over 80% were achieved, although tasks and participants varied between studies. Barriers to progress in the field included a focus on basic tasks, lack of standardization between studies, and lack of datasets. ML has the potential to produce accurate and objective surgical skill assessment through the use of methods including HMM, SVM, and ANN. Future ML-based assessment tools should move beyond the assessment of basic tasks and towards real-life surgery and provide interpretable feedback with clinical value for the surgeon.PROSPERO: CRD42020226071.Entities:
Year: 2022 PMID: 35241760 PMCID: PMC8894462 DOI: 10.1038/s41746-022-00566-0
Source DB: PubMed Journal: NPJ Digit Med ISSN: 2398-6352
Shared characteristics of Global Rating Scales.
| Criteria | OSATS | GOALS | GEARS | R-OSATS | GRITS | ASCRS | M-OSATS | ASSET | BAKSSS | SARMS |
|---|---|---|---|---|---|---|---|---|---|---|
| Efficiency | X | X | X | X | X | X | X | X | X | |
| Tissue handling | X | X | X | X | X | X | X | X | ||
| Instrument handling and knowledge | X | X | X | X | X | X | X | |||
| Flow of operation | X | X | X | X | X | X | ||||
| Bimanual dexterity | X | X | X | X | X | X | ||||
| Depth perception | X | X | X | X | X | X | ||||
| Knowledge of procedure | X | X | X | X | ||||||
| Autonomy | X | X | X | X | ||||||
| Use of assistants | X | X | X |
OSATS Objective Structured Assessment of Technical Skills[1,54], GOALS Global Assessment Tool for Evaluation of intraoperative Laparoscopic Skills[5], GEARS Global Evaluative Assessment of Robotic Skills[6], R-OSATS Robotic-Objective Structured Assessment of Technical Skills[7], GRITS Global Rating Index for Technical Skills[55], ASCRS American Society of Colon and Rectal Surgeons Assessment Tool for Performance of Laparoscopic Colectomy[2], M-OSATS Modified Objective Structured Assessment of Technical Skills[56], ASSET - Arthroscopic Surgical Skills Evaluation Tool[3], BAKSSS Basic Arthroscopic Knee Skill Scoring System[4], SARMS Structured Assessment of Robotic Microsurgical Skills[57].
Fig. 1PRISMA flow diagram.
Search and study selection process for this review.
Fig. 2Framework for the technical skill assessment process.
Kinematic or video data from differing surgical tasks in a range of environments are recorded and fed to a variety of ML algorithms. The result is the development of a trained model. Novel data can then be fed to these models in order to provide assessment of surgical skill.
Overview of studies included in the systematic review.
| Data | Env | L/R/O | Author | Year | Country | # Trials | # Subjects | Task | Data source | Accuracy |
|---|---|---|---|---|---|---|---|---|---|---|
| K | B | L | King et al.[ | 2009 | UK | 7 | 7 | Laparoscopic tissue dissection task | Body sensor network glove | Not specified |
| K | B | L | Oropesa et al.[ | 2013 | Spain, Norway, Netherlands | 126 | 42 | Grasp and place (one hand), Coordinated pulling, Grasp and transfer | TrEndo tracking system | 71.7–78.2% |
| K | B | L | Weede et al.[ | 2014 | Namibia, Germany | 384 | 96 | Knot tying | NDI (EM) aurora tracking system | Not specified |
| K | B | L | French et al.[ | 2017 | US | 295 | Pool of 98 | Peg transfer, Suturing, Circle cutting | EDGE, custom box trainer | 2 class: 82.5–87.2%; 3-class: 58.9–65.1% |
| K | B | L | Dockter et al.[ | 2017 | US | 91 | Pool of 98 | Peg transfer, Suturing, Circle cutting | EDGE, custom box trainer | 97% |
| K | B | L | Uemura et al.[ | 2018 | Japan | 38; 29 | 28; 29 | Suturing | Magnetic tracking sensor on tip of instrument | 79% |
| K | B | L | Oquendo et al.[ | 2018 | US, Germany | 63 | 32 | Suturing | Ascension trakSTAR 3D EM motion-tracking system | 89% |
| K | B | L | Kowalewski et al.[ | 2019 | Germany | 99 (knot tying) | 28 | Suturing, knot tying | Myo armband | MAE OSATS score: 3.7 ± 0.6 |
| K | B | O | Ahmidi et al.[ | 2012 | US | 378 | 20 | Endoscopic sinus surgery tasks | EM tracker to record endoscope and tool motion. Eye gaze tracker. | 88.6–94.6% |
| K | B | O | Watson[ | 2014 | US | 48 | 24 | Benchtop Venous anastomosis | Inertial measurement unit | 70–83% |
| K | B | O | Sun et al.[ | 2017 | Canada | 12 | 6 | Hand tying | Imperial College Surgical Assessment Device | 100% |
| K | B | O | Nguyen et al.[ | 2019 | Australia | 75, 103 | 15 | Open Suturing, Needle passing, Knot tying | 2 wearable inertial processor unit sensors; da Vinci Robot | 98.40% |
| K | B | R | Varadarajan et al.[ | 2009 | US | 30 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | up to 86% |
| K | B | R | Reiley et al[ | 2009 | US | 57 | 9 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 95–100% |
| K | B | R | Tao et al.[ | 2012 | US | 101 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOUO 26.9–59.0% LOSO 94.4–97.4% |
| K | B | R | Kumar et al.[ | 2012 | US | 176 | 12 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 76.3–83.3% |
| K | B | R | Ahmidi et al.[ | 2013 | US | 39; 110 | 8; 18 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 91.10% |
| K | B | R | Forestier et al.[ | 2017 | France | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOSO: SU 93.7%, NP 81.1%, KT 92.5% LOUO: SU 88.3%, NP 75.3%, KT 89.8% |
| K | B | R | Brown et al.[ | 2017 | US | 114 | 38 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 51.7–75% |
| K | B | R | Zia et al[ | 2018 | US | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | Not specified |
| K | B | R | Wang et al.[ | 2018 | US | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOSO SU 92.5%, NP 95.4%, and KT 91.3%, |
| K | B | R | Wang et al.[ | 2018 | US | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOSO 96% |
| K | B | R | Fard et al.[ | 2018 | US | 75 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOSO KT 82.3% SU 89.9% LOUO KT 77.9% SU 79.8% |
| K | B | R | Ershad et al.[ | 2019 | US | 84 | 14 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 91.05% ± 4.02% |
| K | B | R | Fawaz et al.[ | 2019 | France | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | NP 100% SU 100% KT 93.2% |
| K | B | R | Anh et al.[ | 2020 | Australia | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | LOSO: 90.17–95.63% |
| K | B | R | Khalid et al.[ | 2020 | US | 103 | 8 | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | RMSE Precision 97%; Recall 98%; RMSE OSATS Precision 77% Recall 78% |
| K | B | R | Brown et al.[ | 2020 | US | 740 | Not specified | Suturing, Manipulation, transection, dissection, Needle passing, Knot tying | da Vinci Robot | 80–98% |
| K | B | R | Jiang et al.[ | 2017 | China | 10 | 10 | Peg transfer | Micro Hand S robotic system | Not specified |
| K | R | R | Hung et al.[ | 2018 | US | 78 | 9 | Radical Prostatectomy | da Vinci robot | 87.20% predicting LOS |
| K | R | R | Chen et al.[ | 2020 | US | 68 | 17 | Needle handling/targeting, needle driving, suture cinching | da Vinci robot | 77.40% |
| K | R | O | Ahmidi et al.[ | 2015 | US | 86 | Not specified | Septoplasty | EM sensor on Cottle elevator | 91% |
| K | S | O | Megali et al.[ | 2006 | Italy | 16 | 6 | Simple surgical tasks | LapSim Basic Skills 1.5 simulator | Not specified |
| K | S | O | Ahmidi et al.[ | 2012 | US | 60 | 20 | Endoscopic sinus surgery tasks | Nasal surgery simulator | 93% |
| K | S | O | Poursartip et al.[ | 2017 | Canada | 26 | 26 | Shoulder arthroscopy | Shoulder arthroscopy simulator | 70–95% |
| K | S | O | Topalli et al.[ | 2019 | Turkey | 1260 | 28 | Manipulation tasks | Computer-based simulator | 86% |
| K | S | O | Winkler-Schwartz et al.[ | 2019 | Canada | 250 | 50 | Neurosurgical tumor resection | VR based training platform | 90% |
| K | S | O | Peng et al.[ | 2019 | China | 420 | 14 | Peg transfer | VR based training platform | 96.39% |
| K | S | O | Siyar et al.[ | 2020 | Iran, Canada | 115 | 115 | Neurosurgical tumor resection task | VR based training platform | 86–90% |
| K | S | O | Mirchi et al.[ | 2020 | Canada | 21 | 21 | Anterior Cervical Discectomy | Sim-Ortho simulator | 83.30% |
| V | B | L | Islam et al.[ | 2011 | US | 35 | Aug-19 | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | Not specified |
| V | B | L | Islam et al.[ | 2013 | US, India | 52 | 52 | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | Not specified |
| V | B | L | Islam et al.[ | 2016 | US | 156 | 52 | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | 74% |
| V | B | L | Yamaguchi et al.[ | 2016 | Japan | 38 | 38 | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | Not specified |
| V | B | L | Sgouros et al.[ | 2018 | Greece | 74 | Not specified | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | 96% |
| V | B | L | Loukas et al.[ | 2020 | Greece | 64 | 32 | Peg transfer, knot tying, Suturing, Shape cutting | Endoscopic videos | Not specified |
| V | B | O | Sharma et al.[ | 2014 | US, UK | 31 | 16 | Suturing, knot tying | Endoscopic videos | 93.50% |
| V | B | O | Zia et al.[ | 2015 | US | 71 | 18 | Suturing, knot tying | Endoscopic videos | DCT: 85.7–100%; DFT: 91.4–100% |
| V | B | O | Zia et al[ | 2016 | US, UK | 71; 33 | 18; 16 | Suturing, knot tying | Endoscopic videos | DCT: 97.4–98.4%; DFT: 95.8–97.7% |
| V | B | O | Miller et al.[ | 2018 | US | 70 | 35 | Suturing, knot tying | Endoscopic videos | Not specified |
| V | B | R | Funke et al.[ | 2019 | Germany | 103 | 8 | Suturing, Needle passing, Knot tying | Endoscopic videos | LOSO: 95.1%–100.0%. |
| V | B | R | Gorantla et al.[ | 2019 | US | 24 | 12 | Urethro-vesical anastomosis | Endoscopic videos | HMM 98.18%, LDA 70% |
| V | B | R | Gahan et al.[ | 2020 | US | 23 | Not specified | Urethro-vesical anastomosis | Endoscopic videos | 65–74% |
| V | R | L | Jin et al.[ | 2018 | US | 15 | Not specified | Laparoscopic cholecystectomy | Endoscopic videos | Not specified |
| V | R | R | Baghdadi et al.[ | 2019 | US | 20 | 20 | Pelvic lymph node dissection from Robot assisted radical cystectomy | Endoscopic videos | 83.30% |
| V | R | R | Lee et al.[ | 2020 | South Korea | 54 | 12 | Bilateral axillo-breast approach robotic thyroidectomy | Endoscopic videos | 83% |
| V | R | O | Kim et al.[ | 2019 | US | 99 | Not specified | Capsulorhexis | Endoscopic videos | 63.4–84.8% |
| V | R | O | Azari et al.[ | 2019 | US | 103 | 9 | Hand tie, suturing | Endoscopic videos | Not specified |
| V | S | O | Zhu et al.[ | 2015 | US | 23 | 4 | Capsulorhexis | Kitaro simulator | 58.3–85.2% |
| KV | B | L | Rosen et al.[ | 2001 | US | 8 | 8 | Laparoscopic cholecystectomy, Nissen fundoplication | An instrumented laparoscopic grasper with three-axis force/torque sensor and video | Not specified |
| KV | B | L | Rosen et al.[ | 2001 | US | 10 | 10 | Laparoscopic cholecystectomy, Nissen fundoplication | An instrumented laparoscopic grasper with three-axis force/torque sensor and video | 87.50% |
| KV | B | L | Leong et al.[ | 2007 | UK | 22 | 11 | Point localization | A Polaris infrared tracker on the handle of the laparoscopic instrument and video data | Not specified |
| KV | B | L | Kelly et al.[ | 2020 | US | 454 | 124 | Suturing, peg transfer, clipping cutting | Video, kinematic data from EDGE platform | SU 96.9%, PT 87.5%, PC 87.5%, clipping 73.33% |
| KV | B | O | Zia et al.[ | 2018 | United States | 74 | 41 | Suturing, Knot tying, | Video and accelerometer data | Video: SU 95.1, KT 92.2 Accelerometer: SU 86.8, KT 78.7% |
| KV | B | O | Zhang et al.[ | 2020 | UK | 20–24 per task | 8 | Positioning task, Path following, Needle insertion | Microsurgical Robot Research Platform | 84.7–97.9% |
| KV | S | O | Bissonnette et al.[ | 2019 | Canada | 41 | 41 | L3 hemilaminectomy | NeuroVR platform | 65.9–97.6% |
Data: K kinematics, V video, KV kinematics and video. Env environment: B benchtop, S simulation, R real. L laparoscopic, R robotic, O other. Task: EM electromagnetic, VR virtual reality. Accuracy: MAE mean absolute error, OSATS objective structured assessment of technical skill, LOUO leave-one-user-out, LOSO leave-one-super-trial-out, SU suturing, NP needle passing, KT knot tying, RMSE root mean square error, LOS length of stay, DCT discrete cosine transform, DFT discrete fourier transform, HMM Hidden Markov Model, LDA Linear Discriminant Analysis, PC pattern cutting.
Fig. 3Trends in ML methods used for surgical performance assessment.
Graphical depiction of changes in ML methods used for surgical performance assessment between 2001 and 2020.
Overview of ML algorithms—sequential data modelling models.
| ML Technique | Description | Advantages | Disadvantages | Related Algorithm | References |
|---|---|---|---|---|---|
| Hidden Markov Model (HMM) | A probabilistic model which models a series of observable/hidden states and the probability of transition between hidden states. By detecting the transition of the observable states (e.g., bimanual instrument movements), it estimates the most probable sequence of hidden states (e.g., suturing task). The hidden states often represent the surgical manoeuvres, and the metrics can be inferred from the hidden state transitions. Inferred data can then be used to analysis the performance of the surgeon. | 1. Low model complexity. 2. Relatively less amount of training data needed. 3. Effective at modeling temporal information. | 1. Segmentation of gestures from motion data can be strenuous. 2. Parameter tuning and model development can be time-consuming. 3. Features used in the model are manually defined. 4. Expert knowledge is often required to define the HMM models. | •Maximum Entropy Markov Model. • Markov Random Field. • Conditional Random Fields. • Naïve Bayes | [ |
| Dynamic Time Warping (DTW) | Algorithm which finds the optimal match between two temporal sequences that vary in time or speed | 1. Simple and easy to implement. 2. Highly effective at finding similarities/matches between two sequences. | 1. Features need to be manually defined. 2. Can only compare 2 sequences at a time. 3. Long computational time in search for the optimal match. | • Hidden Markov Model | [ |
Overview of ML algorithms—deep learning methods.
| ML Technique | Description | Advantages | Disadvantages | Related Algorithm | References |
|---|---|---|---|---|---|
| Artificial Neural Network (ANN) or Deep Neural Network (DNN) | ANNs are networks of nodes (or neurons) connected to each other to represent data or approximate the functions. DNNs are ANN with many layers (i.e. deep layers). With deep layers and parallel processing of the neurons, ANNs can learn and determine the optimal features from data, and they can be generalized to yield best classification results even with missing data or unseen scenarios. | 1. Can achieve high accuracy. 2. Able to model complex and nonlinear problems. 3. Can learn patterns and generalize to handle unseen data. 4. Robust and fault-tolerant to noise. | 1. Need large volume of training data. 2. Time-consuming in the training process, and require significant computational power to train complex networks. 3. Difficult to interpret due to its black-box nature. 4. The learning process is stochastic – even training with same data, it may result in different networks. | • Convolutional Neural Networks. • Recurrent Neural Networks | [ |
| Convolutional Neural Network (CNN) | CNN is an artificial neural network with a “Deep” structure, convolution operation layers and pooling layers. CNN has the ability of representation learning, where it could carry out shift-invariant classification of input information based on its hierarchical structure[ | 1. Robust. 2. Parallel processing. 3. Learn representative features from data. 4. Can process data with noise and lack of information. 5. Widely used in image classification with high resolution. 6. Pooling can abstract high-level information. 7. Translation invariant (controversial). | 1. Time-consuming in the training process, and require significant computational power. 2. Pooling may lose detailed and valued information. 3. Poor performance when input image is of low resolution. | • Multilayer Perceptron. • Recurrent Neural Networks | [ |
| Recurrent Neural Networks (RNN) | The recurrent neural networks are designed for modeling sequential processes. It takes the current observation together with the output of the network in previous state to generates the output. | 1. Parameter sharing mechanism and Turing completeness. 2. Memorizing ability makes it suitable for time-series signal processing involving in semantic analysis, sentiment classification, and language translation. | 1. Difficult to train. 2. Imperceptible gradient vanishing problem. 3. Gradient explosion problem, which can be fixed by gradient clipping. 4. Short-term memory issues. | • Long Short-Term Memory. • Gated Recurrent Unit | [ |
Overview of cross-validation techniques.
| Dataset Cross-validation | Description |
|---|---|
| Hold out | Dataset is randomly split into a training and test set. Can suffer from sampling bias and overfitting to the training set. |
| k-fold | Data is split into k folds and the data is trained on k-1 folds and tested on the fold that was left out. Process is repeated and the result is averaged. The major advantage is that all observations are used for both training and validation. |
| Leave-one-user-out (LOUO) | Similar to k-fold validation. In LOUO validation, each surgeon’s trials are used as the test set in turn. Repeated until each surgeon’s trials are used for testing. |
| Leave-one-super-trial-out (LOSO) | Also a variation on k-fold validation. In LOSO validation, a trial from each surgeon’s set of trials is used as the test set. This process is repeated and the result is averaged. This tends to achieve better results compared to LOUO as the algorithm can learn on all surgeons’ trials. |
| Bootstrapping | Bootstrapping is similar to k-fold validation but resamples with replacement such that the new training datasets will always have the same number of observations as the original dataset. Due to replacement, bootstrapped datasets may have multiple instances or completely omit the original cases. |
Overview of ML algorithms: classification methods.
| ML Technique | Description | Advantages | Disadvantages | Related Algorithm | References |
|---|---|---|---|---|---|
| Support Vector Machine (SVM) | Supervised machine learning method which learns the hyperplane or decision boundary between the classes. The hyperplane is deduced by maximizing the geometric distance between the support vectors of the classes. New data will be projected onto the hyperspace and subsequently classified on the basis of relationship to hyperplane. | 1. Can achieve nonlinear classification through kernel. 2. Can be adapted for regression. 3. Easy to understand with low general error. 4. Low inference computational complexity. | 1. Difficult to implement for large training data. 2. Difficult in multi-classification problems. 3. Sensitive to missing data, parameters and kernel function selection. | • Support Vector Regression. • Support vector clustering. • Semi supervised SVM | [ |
| k-nearest neighbors (kNN) | Supervised classification algorithm which groups the points of each class together. During inferencing, the Euclidean distances between the new observed data point and the training data points are calculated. The k-nearest neighbors (i.e., k number of points with the shortest distances to the observed point) are then determined, and the new data point will then be labeled to the class with the highest number of instances in the k-nearest neighbors. | 1. No training is required. 2. Low algorithm complexity. 3. Suitable for multi-class problem. 4. Low cost for re-training. 5. Better in processing overlap field of data. | 1. Bad performance with high dimensional data. 2. Lazy learning, long inferencing time with large datasets. 3. Sensitive to noise, missing data, and outliers. 4. Requires feature scaling of data. 5. Bad performance when imbalanced sampling datasets. | • k-means clustering | [ |
| Naïve Bayes | Supervised classification algorithm based on Bayes Theorem. The simplified from of the Bayes Algorithm—Naïve Bayes is built with the assumption that features are conditionally independent. The class with the highest posterior probability is the outcome of the prediction. | 1. Simple logic and robust. 2. Not sensitive to missing data. 3. Performs well when features are close to conditionally independent. 4. Performs well with small datasets. | 1. Require conditional independence hypothesis. 2. Tends to not perform as well as more complicated models with larger datasets or correlated features. 3. Require prior probability. | • Bayesian Network. • Maximum a Posteriori. • Maximum likelihood. • Gaussian NB. • Multinomial NB. • Bernoulli NB | [ |
| Decision Tree | Supervised classification algorithm. Data are split repeatedly into subsets and eventually classified at terminal nodes according to logics of nodes along the way. | 1. Simple design and interpretable. 2. Suitable for high dimensional data. 3. Low computational power. 4. No domain knowledge or parameter assumptions required. 5. Not sensitive to lost feature. 6. Based on human logics and deterministic. | 1. Tends to overfit. 2. Can be unstable as small changes in data can lead to new tree architecture. 3. Calculations can become very complex. 4. Hard to classify temporal sequences. 5. Require preprocessing work. 6. Sequential process and cannot be parallelized. | • Classification and Regression Tree. • Iterative Dichotomiser 3. • C4.5. • Random Forest | [ |
| Random Forest | Supervised classification algorithm. A tree-based algorithm, which combines multiple randomly created decision trees. | 1. Reduces overfitting in decision tree and improves accuracy. 2. Flexible to regression problems. 3. Robust to missing data. 4. Fast learning speed. | 1. Can require significant computational power. 2. Can be unstable as small changes in data can lead to new tree architecture. 3. Uninterpretable in some feature nodes. 4. High computational cost in inferencing with multiple sequential processes. | • Decision tree | [ |
| Logistic Regression | Supervised classification algorithm based on the logistic (or sigmoid) function | 1. Easy to understand and implement. 2. Fast performance. 3. Good accuracy for simple datasets. | 1. Can be easily outperformed by more complex algorithms. 2. Struggles with nonlinear problems. 3. Sensitive to vague features. | • Linear Regression | [ |
Overview of ML algorithms—feature extraction methods.
| ML Technique | Description | Advantages | Disadvantages | Related Algorithm | References |
|---|---|---|---|---|---|
| Principal Component Analysis (PCA) | Unsupervised linear dimensionality reduction algorithm. It extracts the most significant features with the highest variance in the data. | 1. Reduces overfitting. 2. Improves visualization of data. 3. Improves algorithm performance. 4. Removes features which are correlated. | 1. Principal components (linear combinations of original features) are abstracted information from data and can be hard to interpret. 2. Sensitive to the scale of features and outliers. 3. Trade-off between information loss and dimension reduction. | • Support Vector Machine. Linear Discriminant Analysis. • Feature selection methods | [ |
| Linear Discriminant Analysis (LDA) | Supervised dimensionality reduction and classification algorithm. A statistical method which projects the data onto new axes which maximizes the separability between classes by maximizing the between-class variance and minimizing the within-class variance. | 1. Allows for supervised dimensionality reduction with prior knowledge of the classes. 2. Can outperform PCA as dimensionality reduction technique. | 1. Not suitable for non-Gaussian samples. 2. Prone to overfitting. 3. The projection space cannot exceed the existing dimensions. 4. Limited by the type of samples. | • Principal Component Analysis | [ |
Overview of ML algorithms—clustering methods.
| ML Technique | Description | Advantages | Disadvantages | Related Algorithm | References |
|---|---|---|---|---|---|
| k-means clustering | Unsupervised iterative clustering algorithm which separates unlabeled data into “k” distinct groupings. Observations sharing similar characteristics are therefore clustered together. New point clustered into one of the K groups based its minimum distance to the center of group. The centers will be recalculated iteratively until convergence. The means of the clusters will then be used to determine the classes of new observed data points. | 1. Easy to implement. 2. Low algorithm complexity. 3. Scales to large datasets. | 1. Need to assign k, not suitable for some classification requirements. 2. Sensitive to outliers and initial values. 3. Difficult to cluster data of varying sizes. 4. Difficult to implement with high dimensional data. 5. Not suitable for non-convex classification. | • k-nearest neighbors. • Spectral clustering. • Iterative. • Self-organizing maps | [ |