02.pdf
people.eecs.berkeley.edu · 1,765 words · saved by 1 readers
N/A
Linear Classifiers and Perceptrons 7 2 Linear Classifiers and Perceptrons CLASSIFIERS You are given sample of n observations [aka examples], each with d features [aka predictors]. Some observations belong to class C; some do not. Example: Observations are ice cream lovers Features are height & age (d = 2) Some are in class “chocolate,” some prefer vanilla Goal: Predict preferred flavor based on their height & age. Represent each observation as a point in d-dimensional space, called a sample point /…
related reading
- perceptron learning algo, max margin classifierspeople.eecs.berkeley.edu
- A Course in Machine Learningciml.info
- Support vector machine - Wikipediaen.wikipedia.org
- Classificationfairmlbook.org
- Perceptron - Wikipediaen.wikipedia.org
- 6.036_notes.pdfphillipi.github.io
- lecture_2.pdfcs231n.stanford.edu
- Support vector machine - Wikipediaen.wikipedia.org
- Toy Models of Superpositiontransformer-circuits.pub
- CS231n Deep Learning for Computer Visioncs231n.github.io
- note 6: bayes decision rulepeople.eecs.berkeley.edu
- Lecture 2.pptxcs231n.stanford.edu