Syllabus

Syllabus:
These are the topics you need to master in order to learn Machine Learning.
These courses are available readily in various internet sites and also best Harvard lectures by
Andrew Ng is also available online.
The syllables of Machine Learning are:
1. Introduction
2. Linear Regression with One Variable
3. Linear algebra
4. Linear Regression with Multiple Variables
5. Octave/Matlab
6. Logistic Regression
7. Regularization
8. Neural Networks: Representation
9. Neural Networks: Learning
10. Support vector machine
11. Unsupervised Learning
12. Dimensionality Reduction
13. Anomaly Detection
14. Recommender Systems
15. Large scale Machine Learning
16. Application: Photo OCR
So these are the vast courses that you need to learn in order to master in Machine Learning. Don’t get frustrated at first because good things take time. This might look very difficult but if you have that will power that I can do it and I will do it at any costs, believe me you are going to achieve it.

We need to have basic knowledge in Probability and Statistics so first go through the simple and easier books of lower grades and start from there. You might get a lot of help. Then the second step is to go through Bachelors book. If you have done bachelors in any computer related field then you might be familiar with it. Nevertheless don’t worry you can achieve your goal without any Bachelors degree. All you need it will power.  

Comments

Post a Comment

Popular posts from this blog

Boosting and AdaBoost algorithm.

Image
 Boosting is an ensemble technique that attempts to create a strong classifier from a number of weak classifiers. This is done by building a model from the training data, then creating a second model that attempts to correct the errors from the first model. Models are added until the training set is predicted perfectly or a maximum number of models are added. AdaBoost was the first really successful boosting algorithm developed for binary classification. It is the best starting point for understanding boosting. Modern boosting methods build on AdaBoost, most notably stochastic gradient boosting machines. AdaBoost is used with short decision trees. After the first tree is created, the performance of the tree on each training instance is used to weight how much attention the next tree that is created should pay attention to each training instance. Training data that is hard to predict is given more weight, whereas easy to predict instances are given less weight. Mode...
Read more

Decision tree

Image
A decision tree is a schematic, tree-shaped diagram used to determine a course of action or show a statistical probability. Each branch of the decision tree represents a possible decision, occurrence or reaction. The tree is structured to show how and why one choice may lead to the next, with the use of the branches indicating each option is  mutually exclusive . x Decision Trees are an important type of algorithm for predictive modeling machine learning. The representation of the decision tree model is a binary tree. This is your binary tree from algorithms and data structures, nothing too fancy. Each node represents a single input variable (x) and a split point on that variable (assuming the variable is numeric). A decision tree is faster as compared to linear algorithms because it is generally faster. Trees work with nodes and can be fast as compared to other linear algorithms. The leaf nodes of the tree contain an output variable (y) which is used to make a...
Read more

Random forest algorithm

Image
Random Forest is one of the most popular and most powerful machine learning algorithms. It is a type of ensemble machine learning algorithm called Bootstrap Aggregation or bagging. The bootstrap is a powerful statistical method for estimating a quantity from a data sample. Such as a mean. You take lots of samples of your data, calculate the mean, then average all of your mean values to give you a better estimation of the true mean value. In bagging, the same approach is used, but instead for estimating entire statistical models, most commonly decision trees. Multiple samples of your training data are taken then models are constructed for each data sample. When you need to make a prediction for new data, each model makes a prediction and the predictions are averaged to give a better estimate of the true output value. Random forest is a tweak on this approach where decision trees are created so that rather than selecting optimal split points, suboptimal splits are made by intro...
Read more