6.1 Classifiers

We assume that LR has seen enough discussion in the preceding chapters, and use this space to briefly describe the SVM, KNN and BC classifiers. However, we will take a moment to refresh our memory of the time complexity of our LR implementations. We made the claim that LR-CGEPS and LR-CGDEVEPS have time complexity O$\left( m \right)$ where $m$ is the number of nonzero entries in the matrix $X$ in Section 5.1.2. CG-MLE has the same time complexity as CG, which is again O$\left( m \right)$. We will use LR to refer to the three LR implementations collectively.