Selecting the Number of Clusters
With K-Means, you could use the inertia or the silhouette score to select the appropriate number of clusters, but with…
Author: Geeky Codes
Tokenization in NLP
Word Level Tokenzation Splitting text into individual words “the quick brown fox” -> [“the”,”quick”,”brown”,”fox”] BUT Character Level Tokenization Splitting text…
What is Exploratory Data Analysis (EDA)?
Exploratory Data Analysis (EDA) is an essential step in any data science project. It involves investigating and analyzing datasets to…
SQL | Alias Operator
SQL Alias Syntax for Columns: Also read Alias Example Assume we have a table called “Persons” and another table called…
SQL | The LIKE Operator
SELECT column_name(s) FROM table_name WHERE column_name LIKE pattern LIKE Operator Example The “Persons” table: Now we want to select the…
Using clustering for image segmentation
Image segmentation is the task of partitioning an image into multiple segments. In semantic segmentation, all pixels that are part…
Accelerated K-Means and Mini-batch K-Means
Introduction Another important improvement to the K-Means algorithm was proposed in a 2003 paper by Charles Elkan. It considerably accelerates…
Web Development Project Guide for Freshers
Web Development Project Guide for Freshers Starting your journey as a web developer can be both exciting and challenging. To…
Letter Combinations of a phone number
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any…
3 Sum Closest | LeetCode
Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of…
RAG using Llama 2, Langchain and ChromaDB
Introduction Objective Use Llama 2.0, Langchain and ChromaDB to create a Retrieval Augmented Generation (RAG) system. This will allow us…
Finding the Top K Most Frequent Elements in an Array
Finding the top ( k ) most frequent elements in an array is a common question in coding interviews and…
Finding the Top K Largest Elements in an Array
In many coding interviews and real-world applications, finding the top ( k ) largest elements in an array is a…
XGBoost: A Comprehensive Tutorial
Introduction: In the realm of machine learning algorithms, XGBoost stands tall as a powerhouse, renowned for its efficiency, effectiveness, and…
Counting Odd and Even Occurrences in an Array
Introduction: In programming, it’s common to encounter scenarios where you need to count the number of elements occurring an odd…
Finding the Longest Palindromic Subsequence
Introduction: Dynamic Programming (DP) is a powerful algorithmic technique used to solve a variety of optimization problems. One classic problem…
Titanic – Advanced Feature Engineering Tutorial
Introduction I decided to write this kernel because Titanic: Machine Learning from Disaster is one of my favorite competitions on Kaggle. This…
Regression and Classification Multi Layer Perceptrons
Introduction In the dynamic landscape of machine learning, Multilayer Perceptrons (MLPs) emerge as formidable tools capable of handling both regression…
Save the Prisoner Program in Python | Hacker Rank Solution
A jail has a number of prisoners and a number of treats to pass out to them. Their jailer decides…