Machine Learning Algorithms for GATE

The algorithmic core of GATE ML: fit a function, measure error honestly, avoid memorising. Every algorithm below answers the same three questions — what is predicted, how error is measured, how complexity is controlled.

Important concepts

GATE relevance

Margin vs probability outputs, kernel intuition, tree impurity, boosting error-correction, metric choice on imbalanced data, and cross-validation design.

Important formulas

J=Σ(y−ŷ)² · w←w−η∇J · σ(z)=1/(1+e⁻ᶻ) · F1=2PR/(P+R)

Worked example

Two points (0,1),(2,5): slope=(Σ(x−x̄)(y−ȳ))/(Σ(x−x̄)²)=4/2=2, intercept=3−2·1=1, so ŷ=2x+1 passes through the mean point — least squares in one line.

Practice questions

150 practice questions across all ten units, then mock test. Theory: Units 3–6 + formula sheet.

Related topics

Probability · Statistics · Deep learning

FAQ

Which algorithms matter most?

Linear/logistic regression, Naive Bayes, kNN, trees/forests, SVMs, boosting, k-means, PCA — plus metrics and validation.

How do I choose a metric?

Costs decide: balanced classes use accuracy; rare positives use precision/recall/F1 and PR curves, never raw accuracy alone.