To understand these concepts you must first know about the fundamentals of a confusion matrix. Assuming that you are already familiar with the concepts, let us deep dive into sensitivity, specificity, ROC curve. In the above confusion matrix, we can observe that the TP = 100, TN = 50 and…

Today we are going to take a look at an important technique when dealing with unbalenced datasets. Unbalanced datasets usually have a target feature that has very high number of samples for one particular class and very low samples for the other classes. This makes it extremely difficult for the…

First, let us understand the most fundamental part of pandas. One that must come to you naturally as you keep practicing pandas. The two data types in pandas. There are two most used and fundamental data types that the pandas’ library supports. Series Dataframe A pandas series is a one-dimensional…

Understanding Virtual environments Throughout my journey, I’ve taught Python programming to many beginners. Helped them reach an intermediate level in terms of solving coding challenges, and understanding data structures and algorithms. But when it comes to building their projects, they all make the same mistake. They install their libraries globally. As a beginner…

Clustering algorithms are one of the most popular algorithm used by machine learning practitioners across the world for classification problems. …

1. Nightingale Diagram It can be called as one of the most oldest data visualisation innovation. Florence Nightingale came up with an idea to plot the bar graphs one upon the other, without losing any valuable insights. She did this by plotting not along an X-Y axis, but but eliminating the length of…

I have a very large integer value such as 2874. I wrote a function that can return me a list containing all possible outcomes if I start placing commas between this large integer value. How can i reduce the complexity of this function Input: 2874 Output: [[2874],[2,874],[28,74],[287,4],[2,8,74],[2,87,4],[28,7,4],[2,8,7,4]] Explanation: #zero commas [2874] #one…

Jump Search is a searching algorithm for sorted arrays. The basic idea is to check fewer elements (than linear search) by jumping ahead by fixed steps or skipping some elements in place of searching all elements. For example, suppose we have an array arr[] of size n and block (to be…

Search a sorted or non-sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it…