Gaetano Settembre's repositories
K-Means-clustering
k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells. It is popular for cluster analysis in data mining. k-means clustering minimizes within-cluster variances (squared Euclidean distances), but not regular Euclidean distances, which would be the more difficult Weber problem: the mean optimizes squared errors, whereas only the geometric median minimizes Euclidean distances. For instance, Better Euclidean solutions can be found using k-medians and k-medoids.
Turing-Machine-JFLAP
In this repository, you will find some Turing Machines created using JFlap
BrainTumor_clf_TDA
This repository is the official code for the paper "Enhanced MRI Brain Tumor Detection and Classification via Topological Data Analysis and Low-Rank Tensor Decomposition" by Serena Grazia De Benedictis, Grazia Gargano and Gaetano Settembre.
covidashit
COVID-19 Italy Pandemic and Vaccines Dashboard
gaetanosettembre
Config files for my GitHub profile.
gaetanosettembre.github.io
The source code for the personal page of this user
Headphone-Assistant
CLIPS Project for my ICSE exam.
Movie-Recommender-System-on-Apache-Spark
This notebook summarizes results from a non-personalized and collaborative filtering recommender system implemented with Apache Spark MLlib