There are 1 repository under manhattan-distance topic.
A Keras Implementation of Attention_based Siamese Manhattan LSTM
Eight Puzzle solver using BFS, DFS & A* search algorithms
Sliding Puzzle solver and utilities
8-puzzle game that features a walkthrough of the optimal solution and allows users to customize the tiles using photos from their Gallery
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
Linkage Methods for Hierarchical Clustering
A sliding puzzle game and solver using ncurses.
Complete Java Approach
Classic n-puzzle problem solver using A* search
Python 3 library for Multi-Criteria Decision Analysis based on distance metrics, providing twenty different distance metrics.
🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.
C codes for the Arificial Intelligence Course and algorithms.
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.
Machine learning functions written in goLang:
Our experience in AB Inbev Brewing data cup 2020 for Mexico
PHP based recommender system that can be used to predict values, find similar items or getting recommendations for user
A movie recommendation system, or a movie recommender system, is an ML-based approach to filtering or predicting the users' film preferences based on their past choices and behavior.
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
KNN movie recommendation system using python 🎥✨
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.
[WIP] This is an implementation of the A star search which uses Heuristic function to find the shortest path in C++.
Functions for generating Voronoi diagrams with alternate metrics.
Solution of 8 Puzzle Problem in Python using Informed Search
Autoencoder dimensionality reduction, EMD-Manhattan metrics comparison and classifier based clustering on MNIST dataset
A C-based 8 puzzle solver using graphs and Abstract Data Types and 3 search-algorithms: DFS, BFS, Best-First with Manhattan Distance
3 part project: A. bottleneck autoencoder, B. manhattan distance, C. earth mover's distance
Collection of Generic Data Structures and Algorithms in C.
This python file solves 8 Puzzle using A* Search with Manhattan Distance
4x4 15 piece sliding puzzle solution using A* and IDA* algorithms (Python implementation)
In this repository, I have implemented Machine Learning algorithms, not just by using predefined libraries, but also from scratch by uncovering the underlying math and applied them on datasets.
Solving Stage Puzzles: Text UI
8 Puzzle Solver Using Classical Search Algorithms: DFS | BFS | A*