icon picker

How can we partition a given set of points into k clusters such that each point is assigned to the nearest center or cluster centroid? YesterdayMaria Sofia Bucarelli presented her work on clustering, accepted at NIPS23, during the Kolmogorov meets Turing workshop at DIAG, Sapienza.
Today Andrea Bacciu presented the paper "DanteLLM: Let’s Push Italian LLM Research Forward!” at COLING-LREC in Turin, coauthored by Cesare Campagnano, Giovanni Trappolini and Fabrizio Silvestri. A total "RTSLess" paper. Here is the paper: https://aclanthology.org/2024.lrec-main.388/
Thrilled to announce that our full research paper, "Investigating the Robustness of Sequential Recommender Systems Under Training Data Perturbation" (co-authored by Filippo Betello, Federico Siciliano, Pushkar Mishra, and Fabrizio Silvestri), has been accepted at the ECIR 2024 conference. In our study, we delve into the effects of item positioning within chronologically ordered training sequences. Our findings reveal a substantial impact: removing the most recent items can degrade NDCG@20 by as much as 60%, and the resulting ranked lists of suggestions share merely 10% of the ground truth items. These insights underscore significant implications for real-world recommender system applications. Access the preprint version here https://arxiv.org/pdf/2307.13165v2.pdf to read the full details. Looking forward to seeing you in Glasgow 🥳!
We are at LoG meetup - Trento. Come and chat with us during the poster session about our works "Link Prediction with Graph Neural Networks" and "Hypergraph Neural Networks through the Lens of Message Passing: A Common Perspective to Homophily and Architecture Design". We'll be glad to talk with you.
There are no rows in this table

Want to print your doc?
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
) instead.