Euclidean Distance, Quantization, RGB, HSV

A K Nearest Neighbors classifier developed from scratch for self-learning purposes. Accuracy is off the charts, since we have full control on the algorithm.

Graphql API to recommend tourist sites based on user search criteria using the Euclidean distance algorithm.

Get distance between two coordinates using euclidean distance formula

An example of a minimum distance classificator doing a comparison between using Mahalanobis distance and Euclidean distance.

Sviluppo dell'algoritmo esteso di euclide. Permette all'utente di calcolare l'MCD tra due numeri interi e restituisce i coefficenti dell'identità di Bezout.

A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user's location preferences and the locations. The binary data (0,1) are the location characteristics.

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.

A Java console application that implemetns k-fold-cross-validation system to check the accuracy of predicted ratings compared to the actual ratings.

A Java console application that implemetns k-fold-cross-validation system to check the accuracy of predicted ratings compared to the actual ratings and RMSE to calculate the ideal k for our dataset.

This work is for my thesis. This paper is published on I-IKM-2019

统计分析课程实验作业/包含《统计分析方法》中因子分析，主成分分析，Kmeans聚类等典型算法的手写实现

Allows for calculation of many types of distance between points

This course teaches you how to calculate distance metrics, form and identify clusters in a dataset, implement k-means clustering from scratch and analyze clustering performance by calculating the silhouette score

This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.

Eight Puzzle solver using BFS, DFS & A* search algorithms

This Lua module calculates the "infinite distance" between two sprites and detects the collision between them. Integration of the following specific distance cases: Manhattan distance (K distance with k = 1), Euclidean distance (K distance with k = 2), K distance (with k > 2). Integration of scale factors a and b for sprites.