4. Clinical Prediction Models Flashcards
what is a perceptron
what is an svm
f is a sigmoid function and output is consistent with binary labels
what is a multi-layer perceptron
f is a sigmoid function or other non-linear function, that can form a stack of many layers
what is deep learning
what are some famous NN
googleNet
alexNet
what should be considered for knn
- value of k (number of nearest neighbours to retrieve), rule is that k = sqrt(number training points)
- what distance metric to use
- computation (data size, dim size)
what happens if k is too small/ too large
- too small = not general, sensitive to noise
- too large = may include points from other classes
what are some distance measures for knn
- euclidean = straight line distance between points
- manhattan = measures distance if a grid like path is followed
- cosine = angle between two vector representations of data points
- hamming = the number of points that differ between two collections of values
draw cosine distance
draw manhattan distance
draw euclidean distance
how do we deal with the computational complexity of knn
- compute only an approximate distance
- remove redundant data
- pre-sort (index)
what are some evaluation metrics
confusion matrix:
- tp = positive values correctly identified
- fp = negative values identified as positive
recall = ratio of actual positives to those correctly identified
precision = ratio true positives actually classified as positives
f = harmonic mean of precision & recall