Skip to content
#

euclidean-distance

Here are 65 public repositories matching this topic...

A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user with only a few non zero ratings of some locations, find the k nearest neighbors through similarity score and then predict the ratings of the new user for the non rated locations.

  • Updated Dec 18, 2019
  • Java

The N-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle can be of any size, with the most common sizes being 3x3 and 4x4. The objective of the puzzle is to rearrange the tiles to form a specific pattern.

  • Updated Feb 10, 2023
  • Python

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