▲

Imagine training a classifier on a dataset only to find your friend is almost as good guessing at the target label, that too without looking at the data. Is your classifier any good then?

▲

A linked list is a sequential data structure. A head pointer points to the first node and each node has a pointer to the next. The last node is suitably terminated. Manipulating a linked list is an exact exercise and reversing it certainly so. Would a cutaway view be helpful?

▲

Dynamic Programming is an algorithmic technique to solve constrained, combinatorial optimization problems. The Knapsack here is a metaphor for the constraint. The ‘knapsack’ might as well be a container ship.

▲

Classification datasets often have a number of categorical variables. There is always the need to select the more important categorical variables for modelling, especially in high-dimension datasets.

▲

Neural Networks are very fascinating, but they are very complicated to understand. To simplify our understanding, we start with the simplest unit of the neural network – the perceptron. We want to understand what role the perceptron plays and its functioning as a simple logical unit. This should hopefully improve our understanding of a neural network.

Listen – this blog post explained Often, classification datasets have a mix of continuous and categorical data. The continuous data typically have problems such as outliers, noise and lack of a defined distribution.

What is comb-sort? Comb-sort is a newer and modified form of bubble-sort. It seeks to improve the time-complexity of the traditional bubble-sort.

What is bubble sort? Bubble sort is a relatively easy to understand and easy to implement algorithm. It was one of the earliest ones to be discovered.

What is binary search? Binary search is an algorithm for searching elements from a sorted array. It far outweighs in benefits compared to a linear search method.

At times it is necessary to create dataframes within a program. Learn three ways to create them.