Information Technology 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.

Information Technology

Artificial Intelligence & Machine Learning

Agents and search, logic, supervised and unsupervised learning, SVMs and ensembles.

Interview questions
Notes for Artificial Intelligence & Machine Learning are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.

Coming next in Artificial Intelligence & Machine Learning

  1. AI: history and types· notes coming
  2. AI, ML, deep learning and data science· notes coming
  3. Intelligent agents and PEAS· notes coming
  4. Types of agents· notes coming
  5. Problem formulation and state space· notes coming
  6. Uninformed search: BFS, DFS and uniform cost· notes coming
  7. Informed search: greedy best-first and A*· notes coming
  8. Hill climbing and local search· notes coming
  9. Propositional and predicate logic· notes coming
  10. Forward and backward chaining, expert systems· notes coming
  11. Machine learning workflow· notes coming
  12. Data preprocessing· notes coming
  13. Linear and polynomial regression· notes coming
  14. Logistic regression· notes coming
  15. Decision trees· notes coming
  16. K-nearest neighbours and naïve Bayes· notes coming
  17. Evaluating classifiers· notes coming
  18. K-means clustering· notes coming
  19. Hierarchical clustering and DBSCAN· notes coming
  20. Association rule mining· notes coming
  21. PCA and dimensionality reduction· notes coming
  22. Feature selection and cluster evaluation· notes coming
  23. Support vector machines· notes coming
  24. Ensembles: bagging, random forest and boosting· notes coming
  25. Introduction to reinforcement learning· notes coming
  26. Cross-validation and hyperparameter tuning· notes coming
  27. Bias–variance trade-off and responsible AI· notes coming
  28. Concept learning: Find-S and candidate elimination· notes coming
  29. Evaluating hypotheses· notes coming
  30. Linear discriminant analysis· notes coming
  31. Regularisation, early stopping and dropout· notes coming
  32. Perceptrons and multilayer perceptrons· notes coming
  33. Backpropagation in feedforward networks· notes coming
  34. Gradient descent optimisers: momentum to Adam· notes coming
  35. CNN architectures: LeNet to ResNet· notes coming
  36. Visualising convolutional networks· notes coming
  37. Recurrent networks and backpropagation through time· notes coming
  38. LSTM and GRU· notes coming
  39. AI problems and techniques: tic-tac-toe· notes coming
  40. Production systems and problem characteristics· notes coming
  41. Depth-limited and bidirectional search· notes coming
  42. Simulated annealing, beam search and genetic algorithms· notes coming
  43. Constraint satisfaction problems· notes coming
  44. Adversarial search: minimax and alpha-beta pruning· notes coming
  45. Knowledge representation and resolution· notes coming
  46. Bayesian networks and Dempster-Shafer theory· notes coming
  47. Planning: goal stack and hierarchical planning· notes coming
  48. NLP in AI: syntactic, semantic and pragmatic processing· notes coming
  49. Learning: inductive, explanation-based, neural and genetic· notes coming
  50. Expert systems and fuzzy logic· notes coming
  51. Well-posed learning problems and designing a learning system· notes coming
  52. Bayesian learning: MAP, MDL, Bayes optimal and Gibbs· notes coming
  53. PAC learning and VC dimension· notes coming
  54. Autoencoders: denoising, sparse and contractive· notes coming
  55. Loss functions, Lasso and Ridge regression· notes coming