https://github.com/peteprattis/k-nearest-neighbors-for-similarity-by-binary-data

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.
https://github.com/peteprattis/k-nearest-neighbors-for-similarity-by-binary-data

binary-dataset computer-science console-application cosine-similarity euclidean-distance hamming-distance java k-nearest-neighbours knn manhattan-distance program similarity similarity-score student

Last synced: about 7 hours ago
JSON representation

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.

• Host: GitHub
• URL: https://github.com/peteprattis/k-nearest-neighbors-for-similarity-by-binary-data
• Owner: PetePrattis
• License: mit
• Created: 2019-12-17T09:29:38.000Z (almost 5 years ago)
• Default Branch: master
• Last Pushed: 2019-12-17T10:39:29.000Z (almost 5 years ago)
• Last Synced: 2023-09-14T10:17:26.523Z (about 1 year ago)
• Topics: binary-dataset, computer-science, console-application, cosine-similarity, euclidean-distance, hamming-distance, java, k-nearest-neighbours, knn, manhattan-distance, program, similarity, similarity-score, student
• Language: Java
• Size: 10.7 KB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# A Java Program / Project

**This is a java project from my early days as a Computer Science student**

_This programm was created for my thesis project

and is a test program implementing knn algorithm to use as a template for my thesis project_

> #### Description of project

>

>>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.

> #### Impementation of project

>

> 1. Implementing knn algorithm using these heuristics for similarity score:

>> - Cosine similarity

>> - Hamming distance

>> - Euclidean distance 

>> - Manhattan distance

>

> #### About this project

>

> - This is a test project and an effort to implement the knn algorithm using a variety of heuristics for similarity score

> - The comments to make the code understandable, are within the .java archive

> - This project was written in Eclipse Java IDE

> - This repository was created to show the variety of the work I did and experience I gained as a student

>