Skip to main content

Neural Network theory and implementation for Regression

Image for post























Introduction and background

Inthis article, we are going to build the regression model from neural networks for predicting the price of a house based on the features. Here is the implementation and the theory behind it. The neural network is basically if you see is derived from the logistic regression, as we know that in the logistic regression:

Formulae for Logistic Regression: y = ax+b

so for every node in each layer, we will apply it and after this output is from the activation function which will have the input from logistic regression and the output is output from the activation function.

So now we will implement the neural network with 5 hidden layers.

Implementation

1. Import the libraries which we will going to use

Image for post

2. Import the dataset and check the types of the columns

Image for post

3. Now build your training and test set from the dataset.

Image for post

4. Now we have our data we will now make the model and I will describe to you how it will predict the price.

Image for post

Here we are making the neural network 5 hidden layer with activation layer as `relu` and with their nodes in them. The final output is the house price.

5. Now we will fit our dataset and then predict the value.

Image for post

Here we are ready with the neural network and we can use it to predict the house price.

Points to remember for future

  1. Here you can select the number of the layer and then you can see the variance in prediction.
  2. You can also select the activation function which will result in the variance in the accuracy.

Thanks for browsing my pattern, and I hope it benefits you in theory and in practice!!!! 

Comments

Popular posts from this blog

Random Forest and how it works

  Random Forest Random Forest is a Machine Learning Algorithm based on Decision Trees. Random forest works on the ensemble method which is very common these days. The ensemble method means that to make a decision collectively based on the decision trees. Actually, we make a prediction, not simply based on One Decision Tree, but by an unanimous Prediction, made by ‘ K’  Decision Trees. Why should we use There are four reasons why should we us e  the random forest algorithm. The one is that it can be used for both  classification and regression  businesses. Overfitting is one critical problem that may make the results worse, but for the Random Forest algorithm, if there are enough trees in the forest, the classifier  won’t overfit  the model. The third reason is the classifier of Random Forest can handle  missing values , and the last advantage is that the Random Forest classifier can be modeled for  categorical values. How does the Random...

DBSCAN Clustering Algorithm-with maths

  DBSCAN is a short-form of   D ensity- B ased   S patial   C lustering of   A pplications with   N oise. It is an unsupervised algorithm that will take the set of points and make them into some sets which have the same properties. It is based on the density-based clustering and it will mark the outliers also which do not lie in any of the cluster or set. There are some terms that we need to know before we proceed further for algorithm: Density Reachability A point “p” is said to be   density reachable from a point “q” if point “p” is within ε distance from point “q” and “q” has a sufficient number of points in its neighbors which are within distance ε. Density Connectivity A point “p” and “q” are said to be density connected if there exists a point “r” which has a sufficient number of points in its neighbors and both the points “p” and “q” is within the ε distance. This is a chaining process. So, if “q” is neighbor of “r”, “r” is neighbor of “s”, “s” ...