Skip to main content

Posts

Unsupervised Machine Learning — A Friendly, Step-by-Step Tutorial

Think of going into a library with only a single book there, and you are expected to arrange the books. You would most likely begin sorting books by appearance or feel, similar cover art or length or topic, although nobody informed you of the genres. It is the key idea of unsupervised learning: it seeks structure of data in case of no annotated responses. This tutorial explains what is meant by unsupervised learning and why this type of learning is alternative to supervised learning and provides a summary of the most common types of algorithms: Clustering and dimensionality reduction . It also introduces the mathematical intuition behind the underlying basic mathematics of such applications and provides line by line explanation of the K-Means and PCA algorithms in Python. What is Unsupervised Learning — and why it matters? Unsupervised learning Unsupervised learning refers to a group of methods used to determine patterns, clusters or order in data without any target labels. This i...
Recent posts

Introduction to Supervised Machine Learning: Step-by-Step Guide for Beginner

  What is Supervised Machine Learning? Supervised Machine Learning is training a computer in the same way that we train children using examples. Let’s break it step by step Example with Fruits Consider a scenario where you are training a child on how to identify fruits. You show an apple and say, “This is an apple.” You show a banana and say, “This is a banana.” After watching lots of apples and bananas the child begins to notice the patterns : Apples are usually round, red, or green. Bananas are long and yellow. Next time even when you give the child a new apple (not the one you showed him or her before) the child is able to say:  “That looks like an apple!” How Computers Learn in the Same Way In supervised ML: Input (Data) = The items that we present to the computer (such as images of fruits, emails or medical records of patients). Output (Label/Correct Answer) = What the data really is (Apple, Banana, Spam, Not Spam, Healthy, Sick). Lea...

Introduction to Machine Learning – A Beginner’s Guide

The world we live in is a technologically oriented one. Apps that suggest songs, recommend movies, translate languages, identify our faces and even drive cars automatically are used every day. Behind all this progress is something called  Machine Learning (ML) . This blog will describe what Machine Learning is, how it functions, the variations, and the real life examples of this which we can see in our everyday lives in the most simplistic manner. What is Machine Learning? Suppose you have to teach a child to identify fruits. You do not give them a list of rules such as: An apple is round. A banana is long. A mango is yellow. Rather, you  show numerous pictures  of apples, bananas, and mangoes. After enough examples, the child starts to recognize them on their own. Machine Learning is precisely this. It is a way of training  computers to learn from data and examples instead of hard-coded rules . Instead of coding each step we allow the computer to identify patterns...

Early vs Late Binding in C++ (Static vs Dynamic Binding) Explained with Examples

Two concepts you will come to hear frequently when learning OOP are binding and its types: early binding, late binding, static binding, and dynamic binding . The terminology may seem technical initially, but don’t worry — we will decompose them into easy-to-understand analogies and simple code samples (C++) combined with a comparison table. What is Binding in Programming? Binding means linking a function call to the actual function definition.  Example analogy: Imagine you’re calling your friend on the phone. If you know exactly which number to dial before calling → this is early/static binding . If you just say “Call my best friend” and your phone decides at runtime who that is → this is late/dynamic binding . 1. Early Binding (Compile-time Binding / Static Binding) Function calls are resolved at compile time . The compiler already knows which function to call. Faster, but less flexible. Example (C++ Function Overloading): Here, the compiler deci...

C++ Code for Function Overriding Without virtual

Example In C++, function overriding happens when a derived class defines a function with the same name as a base class function. Unless the base class method is specified as virtual, the compiler engages in early binding (compile-time decision). This implies that the base class version will be invoked even when the pointer points to an object of the derived classes. This leads to a lack of real-time polymorphism occurring. Code Example # include < iostream > using namespace std ; class Animal { public : void sound ( ) { // Not virtual cout < < " Animal makes a sound " < < endl ; } } ; class Dog : public Animal { public : void sound ( ) { cout < < " Dog barks " < < endl ; } } ; int main ( ) { Animal * a1 ; Dog d ; a1 = & d ; a1 - > sound ( ) ; // Calls Animal's version (not Dog's) return 0 ; } Output Animal make...

C++ Code for Function Overriding Using Virtual Keyword

Example Function Overriding in OOP occurs when a derived class has its own implementation of a function which already exists in the base class. The base class virtual function should be declared and redefined in the derived class. This also allows Runtime Polymorphism where the relevant function is chosen at run time based on the type of object used. # include < iostream > using namespace std ; class Animal { public : virtual void sound ( ) { // Virtual function cout < < " Animal makes a sound " < < endl ; } } ; class Dog : public Animal { public : void sound ( ) override { // Overriding base class function cout < < " Dog barks " < < endl ; } } ; class Cat : public Animal { public : void sound ( ) override { cout < < " Cat meows " < < endl ; } } ; int main ( ) { Animal * a1 ; Dog d ; Cat c ; ...