Algorithm
Linear regression
Description
Finds a way to correlate each feature to the output to help predict future values.
Type
Regression
Linear regression
Description
Finds a way to correlate each feature to the output to help predict future values.
Type
Regression
Algorithm
Logistic regression
Description
Extension of linear regression thatβs used for classification tasks. The output variable 3is binary (e.g., only black or white) rather than continuous (e.g., an infinite list of potential colors)
Type
Classification
Logistic regression
Description
Extension of linear regression thatβs used for classification tasks. The output variable 3is binary (e.g., only black or white) rather than continuous (e.g., an infinite list of potential colors)
Type
Classification
Algorithm
Decision tree
Description
Highly interpretable classification or regression model that splits data-feature values into branches at decision nodes (e.g., if a feature is a color, each possible color becomes a new branch) until a final decision output is made
Type
Regression
Classification
Decision tree
Description
Highly interpretable classification or regression model that splits data-feature values into branches at decision nodes (e.g., if a feature is a color, each possible color becomes a new branch) until a final decision output is made
Type
Regression
Classification
Algorithm
Naive Bayes
Description
The Bayesian method is a classification method that makes use of the Bayesian theorem. The theorem updates the prior knowledge of an event with the independent probability of each feature that can affect the event.
Type
Regression
Classification
Naive Bayes
Description
The Bayesian method is a classification method that makes use of the Bayesian theorem. The theorem updates the prior knowledge of an event with the independent probability of each feature that can affect the event.
Type
Regression
Classification
Algorithm
Support vector machine
Description
Support Vector Machine, or SVM, is typically used for the classification task.
SVM algorithm finds a hyperplane that optimally divided the classes. It is best used with a non-linear solver.
Type
Regression (not very common)
Classification
Support vector machine
Description
Support Vector Machine, or SVM, is typically used for the classification task.
SVM algorithm finds a hyperplane that optimally divided the classes. It is best used with a non-linear solver.
Type
Regression (not very common)
Classification
β€1
Algorithm
Random forest
Description
The algorithm is built upon a decision tree to improve the accuracy drastically. Random forest generates many times simple decision trees and uses the βmajority voteβ method to decide on which label to return. For the classification task, the final prediction will be the one with the most vote; while for the regression task, the average prediction of all the trees is the final prediction.
Type
Regression
Classification
Random forest
Description
The algorithm is built upon a decision tree to improve the accuracy drastically. Random forest generates many times simple decision trees and uses the βmajority voteβ method to decide on which label to return. For the classification task, the final prediction will be the one with the most vote; while for the regression task, the average prediction of all the trees is the final prediction.
Type
Regression
Classification
Algorithm
AdaBoost
Description
Classification or regression technique that uses a multitude of models to come up with a decision but weighs them based on their accuracy in predicting the outcome
Type
Regression
Classification
AdaBoost
Description
Classification or regression technique that uses a multitude of models to come up with a decision but weighs them based on their accuracy in predicting the outcome
Type
Regression
Classification
Algorithm
Gradient-boosting trees
Description
Gradient-boosting trees is a state-of-the-art classification/regression technique. It is focusing on the error committed by the previous trees and tries to correct it.
Type
Regression
Classification
Gradient-boosting trees
Description
Gradient-boosting trees is a state-of-the-art classification/regression technique. It is focusing on the error committed by the previous trees and tries to correct it.
Type
Regression
Classification
Unsupervised learning
In unsupervised learning, an algorithm explores input data without being given an explicit output variable (e.g., explores customer demographic data to identify patterns)
You can use it when you do not know how to classify the data, and you want the algorithm to find patterns and classify the data for you
In unsupervised learning, an algorithm explores input data without being given an explicit output variable (e.g., explores customer demographic data to identify patterns)
You can use it when you do not know how to classify the data, and you want the algorithm to find patterns and classify the data for you
Algorithm Name
K-means clustering
Description
Puts data into some groups (k) that each contains data with similar characteristics (as determined by the model, not in advance by humans)
Type
Clustering
K-means clustering
Description
Puts data into some groups (k) that each contains data with similar characteristics (as determined by the model, not in advance by humans)
Type
Clustering
Algorithm Name
Gaussian mixture model
Description
A generalization of k-means clustering that provides more flexibility in the size and shape of groups (clusters)
Type
Clustering
Gaussian mixture model
Description
A generalization of k-means clustering that provides more flexibility in the size and shape of groups (clusters)
Type
Clustering
π1
Algorithm Name
Hierarchical clustering
Description
Splits clusters along a hierarchical tree to form a classification system.
Can be used for Cluster loyalty-card customer
Type
Clustering
Hierarchical clustering
Description
Splits clusters along a hierarchical tree to form a classification system.
Can be used for Cluster loyalty-card customer
Type
Clustering
π2
Algorithm Name
Recommender system
Description
Help to define the relevant data for making a recommendation.
Type
Clustering
Recommender system
Description
Help to define the relevant data for making a recommendation.
Type
Clustering
Algorithm Name
PCA/T-SNE
Description
Mostly used to decrease the dimensionality of the data. The algorithms reduce the number of features to 3 or 4 vectors with the highest variances
Type
Dimension Reduction
PCA/T-SNE
Description
Mostly used to decrease the dimensionality of the data. The algorithms reduce the number of features to 3 or 4 vectors with the highest variances
Type
Dimension Reduction
β€1
This media is not supported in your browser
VIEW IN TELEGRAM
Forwarded from π©βπ» Learn PROGRAMMING π¨βπ» (π΄π’ππ’π π‘π’π πΆπππ ππ)
Forwarded from π©βπ» Learn PROGRAMMING π¨βπ» (π΄π’ππ’π π‘π’π πΆπππ ππ)
Follow Our Stock Market Related Instagram Page π
https://instagram.com/s2ckmark3t?igshid=YmMyMTA2M2Y=
Things Provided Here π
πEverything About Stock Marketπ
π²News, Infographics, Quotes, Memes & Facts
https://instagram.com/s2ckmark3t?igshid=YmMyMTA2M2Y=
Things Provided Here π
πEverything About Stock Marketπ
π²News, Infographics, Quotes, Memes & Facts
π1
Should we open a Stock Market Information Channel on TELEGRAM? (There would be Indian & US stock news etc.)
Final Results
76%
Yes
24%
No
βHow to Choose Machine Learning Algorithm
Now in this Machine learning basics tutorial, we will learn how to choose Machine Learning (ML) algorithm:
There are plenty of machine learning algorithms. The choice of the algorithm is based on the objective.
In the Machine learning example below, the task is to predict the type of flower among the three varieties.
The predictions are based on the length and the width of the petal. The picture depicts the results of ten different algorithms. The picture on the top left is the dataset. The data is classified into three categories: red, light blue and dark blue. There are some groupings. For instance, from the second image, everything in the upper left belongs to the red category, in the middle part, there is a mixture of uncertainty and light blue while the bottom corresponds to the dark category. The other images show different algorithms and how they try to classified the data.
Now in this Machine learning basics tutorial, we will learn how to choose Machine Learning (ML) algorithm:
There are plenty of machine learning algorithms. The choice of the algorithm is based on the objective.
In the Machine learning example below, the task is to predict the type of flower among the three varieties.
The predictions are based on the length and the width of the petal. The picture depicts the results of ten different algorithms. The picture on the top left is the dataset. The data is classified into three categories: red, light blue and dark blue. There are some groupings. For instance, from the second image, everything in the upper left belongs to the red category, in the middle part, there is a mixture of uncertainty and light blue while the bottom corresponds to the dark category. The other images show different algorithms and how they try to classified the data.
π1
Challenges and Limitations of Machine Learning
Now in this Machine learning tutorial, we will learn about the limitations of Machine Learning:
The primary challenge of machine learning is the lack of data or the diversity in the dataset. A machine cannot learn if there is no data available. Besides, a dataset with a lack of diversity gives the machine a hard time. A machine needs to have heterogeneity to learn meaningful insight. It is rare that an algorithm can extract information when there are no or few variations. It is recommended to have at least 20 observations per group to help the machine learn. This constraint leads to poor evaluation and prediction.
Now in this Machine learning tutorial, we will learn about the limitations of Machine Learning:
The primary challenge of machine learning is the lack of data or the diversity in the dataset. A machine cannot learn if there is no data available. Besides, a dataset with a lack of diversity gives the machine a hard time. A machine needs to have heterogeneity to learn meaningful insight. It is rare that an algorithm can extract information when there are no or few variations. It is recommended to have at least 20 observations per group to help the machine learn. This constraint leads to poor evaluation and prediction.
π1