Eight Puzzle solver using BFS, DFS & A* search algorithms
-
Updated
May 8, 2020 - Java
Eight Puzzle solver using BFS, DFS & A* search 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.
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 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.
A Java console application that implemetns k-fold-cross-validation system to check the accuracy of predicted ratings compared to the actual ratings.
Add a description, image, and links to the euclidean-distance topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-distance topic, visit your repo's landing page and select "manage topics."