Skip to content
#

euclidean-distance

Here are 73 public repositories matching this topic...

This Jupyter notebook demonstrates image segmentation using Lazy Snapping and K-Means Clustering. It showcases how these algorithms can partition an image into segments based on pixel intensity and user-defined masks.

  • Updated Jun 17, 2024
  • Jupyter Notebook

the code uses KNN, Gaussian Naive Bayes & SVM to classify images. It preprocesses, normalizes data, applies PCA , computes accuracy, precision etc. It evaluates k-NN using Euclidean distance & cosine similarity, visualizing results with line plots, 3D scatter plots, & confusion matrices to demonstrate classifier performance.

  • Updated Jun 19, 2024
  • Jupyter Notebook

This repository contains a Python implementation of a K-Nearest Neighbors (KNN) classifier from scratch. It's applied to the "BankNote_Authentication" dataset, which consists of four features (variance, skew, curtosis, and entropy) and a class attribute indicating whether a banknote is real or forged.

  • Updated Aug 24, 2023
  • Python

Improve this page

Add a description, image, and links to the euclidean-distance topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the euclidean-distance topic, visit your repo's landing page and select "manage topics."

Learn more