Team members: Mousaalreza Dastmard - Francesco Pezone - Sri vaishnavi Reddy
Goals of this assignment are:
- Bloom filter using hashing to make faster the procedure of checking an element is already exit in a set.
- Alphabetical sorting using counting sort as it's core.
- Implementing K-means
- Drawback of K-means when it takes too much time
The repository includes the following files:
-
main.ipynb:A Jupyter notebook which provides an overview of every single step of which the process to implement the code has consisted in.
-
hashing_lib.py:A Python file which contains the code about hashing and bloom filter and finding the true false positives.
-
sorting_lib.py:A Python file which has all the functions needed for alphabetical sorting and analysing empirical running time.
-
clustring_lib.py:A Python file containing the code needed to implement K-means on given data.
-
theoretical_lib.py:A Python file with all are needed to check the K-means cons and the posibility of trapping in local minimum.