Artificial Intelligence & Data Science is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Artificial Intelligence & Data Science

Machine Learning

Feature engineering and PCA, regression, classification and SVM, clustering and ensembles, Q-learning.

Interview questions
Your progress in this subject0 of 8 · 0%
  1. 1Types of learningOverview of the main types of machine learning (supervised, unsupervised, semi‑supervised, reinforcement, self‑supervised, transfer, online/batch, active and federated), with formal definitions, core formulas (empirical/expected risk), exam-style derivations, diagrams to draw, worked model-answer ex
  2. 2Models of machine learningOverview of common families of machine-learning models, how they represent functions, their assumptions, and how to choose and evaluate them.
  3. 3Feature engineeringFeature engineering means converting raw data into informative features (numeric or categorical) that help machine-learning models learn better; it covers scaling, encoding, missing-value handling, transformations, interaction and polynomial features, binning, and leakage avoidance.
  4. 4Tree-based and support vector regressionClear, exam-oriented notes on decision-tree (CART) regression and support vector regression (SVR): how they work, key formulas, derivations, worked examples, common mistakes and exam tips.
  5. 5K-nearest neighboursK-nearest neighbours (KNN) is a simple, instance-based supervised learning algorithm used for classification and regression that predicts a query point's label from the labels of its nearest training examples.
  6. 6Bagging and random forestsBagging (bootstrap aggregating) and Random Forests are ensemble methods that reduce model variance by training many decision trees on bootstrap samples and aggregating their predictions; random forests further decorrelate trees by selecting random subsets of features at each split.
  7. 7Boosting and stackingBoosting builds a strong predictor by adding many weak learners in a stagewise way (AdaBoost, gradient boosting); stacking combines different trained models by learning a meta-learner on their predictions.
  8. 8Markov decision processesMarkov decision processes (MDPs) formalise sequential decision making under uncertainty using states, actions, transition probabilities and rewards; they underpin dynamic programming and reinforcement learning methods such as value iteration and policy iteration.

Coming next in Machine Learning

  1. What machine learning is· notes coming
  2. Principal component analysis· notes coming
  3. Linear discriminant analysis· notes coming
  4. Simple and multiple linear regression· notes coming
  5. Polynomial regression· notes coming
  6. Bias-variance trade-off· notes coming
  7. Ridge and lasso regularisation· notes coming
  8. Regression metrics· notes coming
  9. Binary and multiclass classification· notes coming
  10. Classification metrics· notes coming
  11. Multiclass strategies and averaging· notes coming
  12. Support vector machines· notes coming
  13. Kernel functions· notes coming
  14. Hierarchical clustering· notes coming
  15. K-means and choosing k· notes coming
  16. DBSCAN· notes coming
  17. Gaussian mixture models· notes coming
  18. Elements of reinforcement learning· notes coming
  19. Bellman equation· notes coming
  20. Exploration and exploitation· notes coming
  21. Q-learning· notes coming
  22. Elastic net and Bayesian linear regression· notes coming
  23. Imbalanced classification· notes coming
  24. K-medoids and K-prototype· notes coming
  25. Voting ensembles· notes coming
  26. XGBoost· notes coming
  27. Hypothesis space and inductive bias· notes coming
  28. Cross-validation and model evaluation· notes coming
  29. Decision tree learning and overfitting· notes coming
  30. Collaborative filtering for recommendation· notes coming
  31. Bayesian learning and naive Bayes· notes coming
  32. Logistic regression· notes coming
  33. Perceptron and multilayer networks· notes coming
  34. Backpropagation in neural networks· notes coming
  35. Computational learning theory and PAC learning· notes coming
  36. Sample complexity and VC dimension· notes coming
  37. Loss functions in machine learning· notes coming
  38. Feature selection: filter, wrapper and embedded methods· notes coming
  39. ICA, CCA and NMF· notes coming
  40. Self-supervised learning and AutoML· notes coming
  41. Explainable AI and federated learning· notes coming
  42. Error-correcting output codes· notes coming
  43. KD-trees and efficient nearest-neighbour search· notes coming
  44. Eligibility traces and TD(λ)· notes coming
  45. Hopfield networks and bidirectional associative memory· notes coming
  46. Adaptive resonance theory: ART1 and ART2· notes coming