Electronics & Telecommunication (University) 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.
Electronics & Telecommunication (University)
Fundamentals of Machine Learning
Supervised learning, Bayesian decision theory, dimensionality reduction, clustering, decision trees, kernel machines and model evaluation.
Your progress in this subject0 of 9 · 0%
- 1Introduction to machine learningIntroduction to machine learning: formal problem statement, losses and risk, empirical risk minimisation, types of learning, basic assumptions and how an engineer chooses and evaluates models.
- 2Regression basics and the bias–variance trade-offBasics of regression (linear least squares) and the bias–variance trade-off: definitions, OLS derivation, assumptions, error decomposition, diagrams to draw, worked numerical examples, common mistakes and exam tips.
- 3PCA and LDAPrincipal Component Analysis (PCA) finds directions of maximal variance for dimensionality reduction; Linear Discriminant Analysis (LDA) finds directions that best separate labelled classes by maximising between-class to within-class scatter.
- 4K-means and K-medoidsK-means partitions data by minimising within-cluster squared Euclidean distance using centroids; K-medoids is a robust variant that uses actual data points (medoids) and minimises sum of pairwise distances.
- 5Clustering and hierarchical clusteringPractical, exam-ready notes on clustering with emphasis on hierarchical (agglomerative and divisive) methods, linkage rules, dendrograms, and worked examples.
- 6K-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.
- 7Regression evaluation metricsClear, exam-focused notes on common regression evaluation metrics (residuals, MSE, RMSE, MAE, MAPE, R², adjusted R², explained variance), when to use each, derivations, diagrams to draw, and worked numerical examples with units.
- 8Confusion matrix, precision, recall and F1Confusion matrix and the measures precision, recall (sensitivity) and F1 score: how to compute them, why they matter, worked numerical examples, common exam mistakes and practice questions.
- 9Feature 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.
Coming next in Fundamentals of Machine Learning
- Hypothesis space and inductive bias· notes coming
- VC dimension· notes coming
- PAC learning and sample complexity· notes coming
- Bayesian decision theory: losses, risks and discriminant functions· notes coming
- Method of moments and maximum likelihood· notes coming
- Cross-validation and micro and macro averaging· notes coming
- Feature selection: sequential forward and backward· notes coming
- Factor analysis, Isomap and locally linear embedding· notes coming
- Singular value decomposition· notes coming
- Multidimensional scaling and matrix factorisation· notes coming
- Expectation maximisation· notes coming
- Spectral clustering· notes coming
- Nonparametric density estimation: histogram and kernel estimators· notes coming
- Gradient descent· notes coming
- Recent trends: self-supervised and federated learning, XAI and AutoML· notes coming
- Pattern recognition systems and the design cycle· notes coming
- Minimax and Neyman–Pearson decision criteria· notes coming
- Syntactic pattern recognition with grammars· notes coming
- Clustering with simulated annealing· notes coming