## K-means Clustering

Preliminaries Numerical Optimization necessary conditions for maximum K-means algorithm Fisher Linear Discriminant Clustering Problem1 The first thing we should do before introducing the algorithm is to make the task clear. A mathematical form is usually the best way. Clustering is a kind of unsupervised learning task. So there is no correct or incorrect solution because there is no teacher or target in the task. Clustering is similar to classification during predicting since the output of clustering and classification are discrete....

March 4, 2020 · (Last Modification: April 28, 2022) · Anthony Tan

## Fisher Linear Discriminant(LDA)

Preliminaries linear algebra inner multiplication projection Idea of Fisher linear discriminant1 ‘Least-square method’ in classification can only deal with a small set of tasks. That is because it was designed for the regression task. Then we come to the famous Fisher linear discriminant. This method is also discriminative for it gives directly the class to which the input $$\mathbf{x}$$ belongs. Assuming that the linear function $y=\mathbf{w}^T\mathbf{x}+w_0\tag{1}$...

February 19, 2020 · (Last Modification: April 28, 2022) · Anthony Tan