Rajat Modi

Ever wondered what machine learning is? AI and ML are the talk of every town these days. This course helps you to break the barriers and understand the basics of machine learning.We help you implement cutting edge machine learning models.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

English

Machine Learning - GATE(CS and IT)

Algorithms

CS & IT

GATE - CSIT, DSAI & Placements

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Introduction to ML

We cover what supervised learning is ,and it’s application to house price prediction and cancer detection. Differences between regression and classification is covered

Supervised Learning

Unsupervised learning- Motivations for the cases where data is unlabelled are explored. Uses of unsupervised learning in gene classification are discussed

Unsupervised Learning

Machine Learning Model

Overview

We analyse the motivations behind cost functions using an example of class scoring system. We go on to define the error function in supervised learning problems.

5) Cost Function Analysis.

Cost function has been visualised in two dimensions by passing all the lines through origin.A two dimensional parabola plot is obtained ,where a minimum value can be obtained by one unique line which is fit to the given point distribution.

6) Cost Function- Graphical Analysis(2D)

A general line depends on two parameters.We cover the dependence of cost function on two parameters of the hypothesis function using contour plots.Intuition for gradient descent is built.

7) Cost Function- Graphical Analysis(3D)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

8 lessons • 50m