We are working on the course content with rocket speed !! sooner we will be loaded with all the courses

Course 1 : Classical Machine Learning Algorithms

Course Curriculum

ML models – Evolution

  • Intro on Machine learning

supervised – Logistic regression
Logistic regression is a popular supervised learning algorithm used for binary classification tasks. It models the relationship between a dependent variable and one or more independent variables by estimating the probabilities of the target class.

supervised – Decision Trees
Decision trees are a popular supervised learning algorithm used for both classification and regression tasks. They provide a clear and interpretable representation of the decision-making process by constructing a tree-like model of decisions and their possible consequences.

Supervised – Random Forest
Random Forest is an ensemble learning method that combines multiple decision trees to make predictions. It leverages the wisdom of the crowd by aggregating the predictions of individual trees.

Supervised – Support Vector Machines
Support Vector Machines (SVM) is a powerful supervised learning algorithm used for classification and regression tasks.

supervised – Naive Bayes model
The Naive Bayes model is a popular supervised learning algorithm commonly used for classification tasks. It is based on the Bayes' theorem and assumes that features are conditionally independent of each other given the class label. Despite its simplicity, Naive Bayes often performs well and is efficient in terms of training and prediction time

Unsupervised – Variations of K-means model

Unsupervised – Hierarchical models

Unsupervised – Density based models

Unsupervised – Gaussian Mixture Models (GMM)

Unsupervised – Spectral Clustering
Spectral clustering treats the data points as nodes in a graph and uses the eigenvectors of the graph Laplacian matrix to find clusters. It first constructs an affinity matrix to measure the similarity between data points and then performs dimensionality reduction on the affinity matrix. Finally, it applies K-means or another clustering algorithm on the reduced-dimensional space to assign the data points to clusters.

Unsupervised – Mean Shift Clustering
Mean Shift clustering is a density-based algorithm that iteratively moves a window (kernel) over the data points, shifting it towards the region of highest density. It aims to find the modes or peaks of the underlying density function, which correspond to the cluster centers. Mean Shift clustering does not require specifying the number of clusters in advance and can handle irregularly shaped clusters.

Unsupervised – Self-Organizing Maps (SOM)
SOM is an artificial neural network-based clustering technique that maps high-dimensional data onto a lower-dimensional grid. It organizes the grid nodes (neurons) based on the similarity of their weight vectors to the input data. SOM preserves the topological relationships between the data points and can reveal the underlying structure of the data. These are just a few examples of clustering models commonly used in machine learning. Each model has its strengths, limitations, and assumptions, and the choice of clustering algorithm depends on the nature of the data, the desired clustering outcome, and the specific requirements of the problem at hand.

Student Ratings & Reviews

No Review Yet
No Review Yet
15,000