## Protected: Analysis of Corona: Why Italy , Germany, what next..

There is no excerpt because this is a protected post.

## 2D to 3D Transformation

Now a days 3d transformation is required in neuroscience in order to visualize the material, even we are proceeding towards the cosmos and try to visualize the object in a 3d space. This article is based on the visualization technique. Lets take the example of a human face. With Deep Learning we have achieved a …

## KNN: K-Nearest Neighbour

This is the story of a person found at JORDAN border, the country is surrounded by 5 neighbors, so how can we find the person belong to which country. KNN plays a vital role here, KNN is a algorithm which stores the whole model, i.e. it will never make any function. It will check the …

## Tensorflow: Basics -I

Let us start with some basics of addition and multiplication program and represent them in a tensorboard. import tensorflow as tfx=tf.constant(1,name=’x’)m=tf.constant(2,name=’y’)z=tf.constant(3,name=’z’)prod=tf.multiply(x,m,name=’multiply’)add=tf.add(prod,z,name=’add’)with tf.Session() as sess: writer=tf.summary.FileWriter(logdir=’./graph’,graph=sess.graph) print(sess.run(add))Output is :5 Now, if we want to check the graph, we have to run following command in Linux(Note: I have used Kali linux), read different types of tensor in …

## Data Analysis-101(WNS)

This analysis is for finding a click event of the user, the details are as : Zbay is an E-commerce website which sells a variety of products at its online platform. Zbay records user behaviour of its customers and stores it as a log. However, most of the times, users do not buy the products …

## Sorting Algorithms

Sorting is a process of arranging elements in increasing or decreasing order. There are different ways of classifying the algorithms, like time complexity, space complexity, stability, Internal/external sorting, recursive/non-recursive sortings. The major Sorting techniques are 1)-Insertion Sort O(N2)  2)-Bubble Sort O(N2)  2)-Selection sort O(N2)  3)-Quick Sort O(N2) 4)-Merge Sort O(NlogN) 5)-Heap Sort O(NlogN) 6)-Bucket Sort …