SUPPORT VECTOR MACHINE

 

What is SVM?

A Support Vector Machine (SVM) is a machine learning algorithm that finds the optimal line (or boundary) that separates different classes of data.

This boundary is chosen so that it has the maximum distance from the nearest data points of each class.

📌 Those closest data points are called support vectors.


Intuitive Example 

🍎 Example: Separating Apples and Oranges

Imagine you have a basket with apples and oranges scattered on a table.

Your task:

  • Draw a line to separate apples from oranges

  • Choose a line that leaves maximum space on both sides

That line is the SVM decision boundary.

📌 If new fruit appears, SVM uses this boundary to classify it correctly.


Why SVM Is Useful

SVM is popular because it is:

  • Effective in high-dimensional data

  • Works well for small and medium datasets

  • Powerful for text and image classification

  • Less affected by outliers

📌 Common Applications:

  • Spam email classification

  • Face recognition

  • Text classification

  • Medical diagnosis


Key Advantage 

SVM doesn’t just separate data—it finds the best possible separation with the maximum safety gap.
This helps the model make more accurate predictions.


Mini Summary

Support Vector Machine (SVM) is a machine learning algorithm used to classify data by drawing the best possible boundary between different groups. By maximizing the distance between classes, SVM makes reliable predictions without needing complex math, making it easier for beginners to understand.


Comments

Post a Comment

Popular posts from this blog

K-Nearest Neighbours (KNN)

  K-Nearest Neighbours (KNN) is one of the simplest machine learning algorithms used for classification and prediction . It works by comparing new data with existing data and making decisions based on similarity . 📌 Simple idea: “Tell me who your neighbours are, and I’ll tell you who you are.” How KNN Works? KNN follows a very simple process: Choose a value of K (number of neighbours) Measure the distance between the new data point and existing points Find the K nearest neighbours Take a majority vote (for classification) Assign the final class 📌 Key point: KNN does not learn beforehand. It makes decisions at the time of prediction . Simple Example: Predicting Categories 👕 Example: T-Shirt Size Prediction Suppose we want to predict T-shirt size based on height and weight. Height (cm)                Weight (kg)                Size 160 55 Small 165 60 Medium 170 6...
Read more

INTRODUCTION TO DEEP LEARNING

Difference Between Machine Learning and Deep Learning Machine Learning (ML)                                                             Deep Learning (DL) Uses smaller models Uses large neural networks Needs manual feature selection Learns features automatically Works well with less data Needs large amounts of data Faster to train Takes more time & computing power Easier for beginners More complex 📌 Simple way to remember: ML → Learns with human guidance DL → Learns deeply on its own Popular Applications of Deep Learning Deep Learning powers many advanced AI systems we use today. 📷 Image Recognition Face recognition on phones Identifying objects in photos 🎙 Speech Recognition Voice assistants like Siri and Alexa 🚗 Self-Driving Cars Detects roads, pedestrians, and signs ...
Read more

DECISION TREE ALGORITHM

  What is a Decision Tree? A Decision Tree is a machine learning algorithm used for both classification and prediction . It breaks a complex problem into smaller decisions , making it easy to understand and interpret. Each part of a decision tree has: Root Node – starting point Decision Nodes – questions Leaf Nodes – final outcome 📌 Simple idea: If-else conditions represented in a tree structure. Example Scenario  🎬 Example: Deciding Whether to Watch a Movie Let’s say you want to decide whether to watch a movie. Questions the Decision Tree might ask: Is it a weekend? Do I have free time? Is the movie rating good? If YES to all → Watch the movie If NO to any → Don’t watch How a Decision Tree Makes Decisions A Decision Tree follows these simple steps: Starts at the root node Checks a condition Follows the correct branch (Yes/No) Reaches a leaf node (final decision) 📌 In Machine Learning: The tree learns which question...
Read more