learning means the acquisition of knowledge or skills through study or experience. based on this, we can define machine learning (ml) as follows −

it may be defined as the field of computer science, more specifically an application of artificial intelligence, which provides computer systems the ability to learn with data and improve from experience without being explicitly programmed.

basically, the main focus of machine learning is to allow the computers learn automatically without human intervention. now the question arises that how such learning can be started and done? it can be started with the observations of data. the data can be some examples, instruction or some direct experiences too. then on the basis of this input, machine makes better decision by looking for some patterns in data.

types of machine learning (ml)

machine learning algorithms helps computer system learn without being explicitly programmed. these algorithms are categorized into supervised or unsupervised. let us now see a few algorithms −

supervised machine learning algorithms

this is the most commonly used machine learning algorithm. it is called supervised because the process of algorithm learning from the training dataset can be thought of as a teacher supervising the learning process. in this kind of ml algorithm, the possible outcomes are already known and training data is also labeled with correct answers. it can be understood as follows −

suppose we have input variables x and an output variable y and we applied an algorithm to learn the mapping function from the input to output such as −

y = f(x)

now, the main goal is to approximate the mapping function so well that when we have new input data (x), we can predict the output variable (y) for that data.

mainly supervised leaning problems can be divided into the following two kinds of problems −

classification − a problem is called classification problem when we have the categorized output such as black, teaching, non-teaching, etc.
regression − a problem is called regression problem when we have the real value output such as distance, kilogram, etc.

decision tree, random forest, knn, logistic regression are the examples of supervised machine learning algorithms.

unsupervised machine learning algorithms

as the name suggests, these kinds of machine learning algorithms do not have any supervisor to provide any sort of guidance. that is why unsupervised machine learning algorithms are closely aligned with what some call true artificial intelligence. it can be understood as follows −

suppose we have input variable x, then there will be no corresponding output variables as there is in supervised learning algorithms.

in simple words, we can say that in unsupervised learning there will be no correct answer and no teacher for the guidance. algorithms help to discover interesting patterns in data.

unsupervised learning problems can be divided into the following two kinds of problem −

clustering − in clustering problems, we need to discover the inherent groupings in the data. for example, grouping customers by their purchasing behavior.
association − a problem is called association problem because such kinds of problem require discovering the rules that describe large portions of our data. for example, finding the customers who buy both x and y.

k-means for clustering, apriori algorithm for association are the examples of unsupervised machine learning algorithms.

reinforcement machine learning algorithms

these kinds of machine learning algorithms are used very less. these algorithms train the systems to make specific decisions. basically, the machine is exposed to an environment where it trains itself continually using the trial and error method. these algorithms learn from past experience and tries to capture the best possible knowledge to make accurate decisions. markov decision process is an example of reinforcement machine learning algorithms.

most common machine learning algorithms

in this section, we will learn about the most common machine learning algorithms. the algorithms are described below −

linear regression

it is one of the most well-known algorithms in statistics and machine learning.

basic concept − mainly linear regression is a linear model that assumes a linear relationship between the input variables say x and the single output variable say y. in other words, we can say that y can be calculated from a linear combination of the input variables x. the relationship between variables can be established by fitting a best line.

types of linear regression

linear regression is of the following two types −

simple linear regression − a linear regression algorithm is called simple linear regression if it is having only one independent variable.
multiple linear regression − a linear regression algorithm is called multiple linear regression if it is having more than one independent variable.

linear regression is mainly used to estimate the real values based on continuous variable(s). for example, the total sale of a shop in a day, based on real values, can be estimated by linear regression.

logistic regression

it is a classification algorithm and also known as logit regression.

mainly logistic regression is a classification algorithm that is used to estimate the discrete values like 0 or 1, true or false, yes or no based on a given set of independent variable. basically, it predicts the probability hence its output lies in between 0 and 1.

decision tree

decision tree is a supervised learning algorithm that is mostly used for classification problems.

basically it is a classifier expressed as recursive partition based on the independent variables. decision tree has nodes which form the rooted tree. rooted tree is a directed tree with a node called root. root does not have any incoming edges and all the other nodes have one incoming edge. these nodes are called leaves or decision nodes. for example, consider the following decision tree to see whether a person is fit or not.

support vector machine (svm)

it is used for both classification and regression problems. but mainly it is used for classification problems. the main concept of svm is to plot each data item as a point in n-dimensional space with the value of each feature being the value of a particular coordinate. here n would be the features we would have. following is a simple graphical representation to understand the concept of svm −

in the above diagram, we have two features hence we first need to plot these two variables in two dimensional space where each point has two co-ordinates, called support vectors. the line splits the data into two different classified groups. this line would be the classifier.

nave bayes

it is also a classification technique. the logic behind this classification technique is to use bayes theorem for building classifiers. the assumption is that the predictors are independent. in simple words, it assumes that the presence of a particular feature in a class is unrelated to the presence of any other feature. below is the equation for bayes theorem −

$$p\left ( \frac{a}{b} \right ) = \frac{p\left ( \frac{b}{a} \right )p\left ( a \right )}{p\left ( b \right )}$$

the nave bayes model is easy to build and particularly useful for large data sets.

k-nearest neighbors (knn)

it is used for both classification and regression of the problems. it is widely used to solve classification problems. the main concept of this algorithm is that it used to store all the available cases and classifies new cases by majority votes of its k neighbors. the case being then assigned to the class which is the most common amongst its k-nearest neighbors, measured by a distance function. the distance function can be euclidean, minkowski and hamming distance. consider the following to use knn −

computationally knn are expensive than other algorithms used for classification problems.
the normalization of variables needed otherwise higher range variables can bias it.
in knn, we need to work on pre-processing stage like noise removal.

k-means clustering

as the name suggests, it is used to solve the clustering problems. it is basically a type of unsupervised learning. the main logic of k-means clustering algorithm is to classify the data set through a number of clusters. follow these steps to form clusters by k-means −

k-means picks k number of points for each cluster known as centroids.
now each data point forms a cluster with the closest centroids, i.e., k clusters.
now, it will find the centroids of each cluster based on the existing cluster members.
we need to repeat these steps until convergence occurs.

random forest

it is a supervised classification algorithm. the advantage of random forest algorithm is that it can be used for both classification and regression kind of problems. basically it is the collection of decision trees (i.e., forest) or you can say ensemble of the decision trees. the basic concept of random forest is that each tree gives a classification and the forest chooses the best classifications from them. followings are the advantages of random forest algorithm −

random forest classifier can be used for both classification and regression tasks.
they can handle the missing values.
it wont over fit the model even if we have more number of trees in the forest.

Save or share this article