Skip to content

Latest commit

 

History

History
27 lines (22 loc) · 3.41 KB

File metadata and controls

27 lines (22 loc) · 3.41 KB
layout about
title about
permalink /
subtitle Newcastle University
profile
align image image_circular more_info
right
profile.jpg
false
<p>Giacomo Bergami (2023)</p> <p>Newcastle University</p> <p>United Kingdom</p>
news false
selected_papers true
social true
image profile.jpg

My full name's pronunciation in IPA is [ˈd͡ʒaːkomo ˈbe:rgami]: I worked as a Lecturer (Assistant Professor) in Game Technology at Newcastle University (Wayback Check,PDF) at NUSE (Wayback Check,PDF), and I am the PI for the LOGic for Data Science (LogDS) group. We advocate that Logic should be used as a main driving force for Data Science to obtain Verified and Explainable Artificial Intelligence.

I received my Bachelor's Degree (110/110, summa cum Laude) from Alma Mater Studiorum, Bologna University on the 13th of November 2012. The Bachelor Thesis, “PjProject su Android: Uno scontro su più livelli” (en. PjProject on Android: a clash on multiple layers), was supervised by Prof. Vittorio Ghini [1][2]; it addressed a feasibility study on porting native Linux applications using the pjsip stack on Android: to check that, I had to study the whole interaction between Java application and native libraries through the so-called Android Middleware (AOSP). I received my Master's Degree (110/110, summa cum Laude) from Alma Mater Studiorum, Bologna University on the 17th of July 2014 (first graduation session) with a thesis called “Hypergraph Mining in Social Networks“, supervised by prof. Danilo Montesi; it addressed for the first time an data mining relational algebra for hypergraphs that had the aim to logically define Data Mining operations and metric over OSNs (On-Line Social Networks). From the 1st of November 2014 to the 1st of November 2017, I was a PhD Candidate at Bologna University, Italy, CSE Dept., School of Sciences. Prof. Danilo Montesi was my PhD supervisor. My PhD thesis focused on two novel graph operators: graph joins (for combining data) and graph nesting (for structural aggregations).