Gaetano Settembre

Gaetano Settembre

@gaetanosettembre

PhD in Computer Science and Math. Graduated in Computer Science and Data Science. Basketball referee.

University of Bari "Aldo Moro" Bari, IT
9
Followers
13
Following
12
Public Repos
0
Private Repos

Language Breakdown

Lines of code distribution across 11 owned repositories

486K Total LOC
Jupyter Notebook
136,584 lines
28.1%
N/A
HTML
132,669 lines
27.3%
N/A
CLIPS
101,834 lines
21.0%
N/A
Java
51,219 lines
10.5%
N/A
CSS
31,152 lines
6.4%
N/A
Other
32,089 lines
6.6%
N/A
M

M-Shaped Developer

M-shaped

Multi-specialist across Jupyter Notebook, HTML, CLIPS

Jupyter Notebook
HTML
CLIPS
Java
CSS

Collaboration Network

Global Impact visualization

LIVE
Gaetano Settembre
0 active collaborators

Repos

16

PRs

0

Growth

+18%

Top Collaborators

No collaborator data yet.

Coding Streak

Contribution activity over the past year

1 day
120
Contributions
117
Commits
0
Pull Requests
Jun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May Jun
Mo
We
Fr
Based on GitHub activity
Less
More

Top Repositories

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.

12 2
Python
data_unmixing

This repository is the official data source for the paper "Advancing blind hyperspectral unmixing in remote sensing: comparing deep-inspired subspace learning methods" by G. Settembre, F. Esposito, N. Del Buono

2 0
Turing-Machine-JFLAP

In this repository, you will find some Turing Machines created using JFlap

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

1 0
Java
insight-icts4ehealth-2026

Repo of Special Session INSIGHT: INtelligent Systems for Imaging-based diaGnosis in HealThcare @ IEEE ICTS4eHealth 2026

0 0
HTML
hyperplast

This repository is the official code for the paper "Superpixel-based plastic litter detection in UAV hyperspectral imaging using spectral-textural features" by G. Settembre, G. Gargano and N. Del Buono. (KES 2025)

0 0
gaetanosettembre.github.io

The source code for the personal webpage page of this user

0 0
HTML
Movie-Recommender-System-on-Apache-Spark

This notebook summarizes results from a non-personalized and collaborative filtering recommender system implemented with Apache Spark MLlib

0 0
Jupyter Notebook
covidashit

COVID-19 Italy Pandemic and Vaccines Dashboard

0 0
Python
gaetanosettembre

Config files for my GitHub profile.

0 0