BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Machine Learning and Deep Learning

321The Instance-Based Learning Paradigm
322The K-Nearest Neighbors Algorithm
323Distance Metrics for KNN
324Choosing K: The Bias-Variance Tradeoff
325Feature Scaling for KNN
326Weighted KNN and Distance Weighting
327Efficient KNN with KD-Trees and Ball Trees
328KNN for Regression and Practical Considerations
329Bayes' Theorem and Posterior Probability
330The Naive Independence Assumption
331Gaussian Naive Bayes for Continuous Features
332Multinomial Naive Bayes for Count Data
333Bernoulli Naive Bayes for Binary Features
334Laplace Smoothing for Zero Probabilities
335Training Naive Bayes: Parameter Estimation
336Naive Bayes Advantages and Limitations

Machine Learning and Deep Learning

321The Instance-Based Learning Paradigm
322The K-Nearest Neighbors Algorithm
323Distance Metrics for KNN
324Choosing K: The Bias-Variance Tradeoff
325Feature Scaling for KNN
326Weighted KNN and Distance Weighting
327Efficient KNN with KD-Trees and Ball Trees
328KNN for Regression and Practical Considerations
329Bayes' Theorem and Posterior Probability
330The Naive Independence Assumption
331Gaussian Naive Bayes for Continuous Features
332Multinomial Naive Bayes for Count Data
333Bernoulli Naive Bayes for Binary Features
334Laplace Smoothing for Zero Probabilities
335Training Naive Bayes: Parameter Estimation
336Naive Bayes Advantages and Limitations

← Machine Learning and Deep Learning

Lesson 327 of 3,538·7. Instance-Based and Probabilistic ClassifiersPro lesson

Efficient KNN with KD-Trees and Ball Trees

Using spatial data structures to reduce search time from O(n) to O(log n) for finding nearest neighbors in lower dimensions.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course