Cesare Bernardis

ORCID: 0000-0002-8972-0850
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Recommender Systems and Techniques
  • Advanced Graph Neural Networks
  • Advanced Bandit Algorithms Research
  • Topic Modeling
  • Expert finding and Q&A systems
  • Mobile Crowdsensing and Crowdsourcing
  • Smart Grid Energy Management
  • Online Learning and Analytics
  • Video Analysis and Summarization
  • Software Engineering Research
  • Consumer Market Behavior and Pricing
  • Image Retrieval and Classification Techniques
  • Advanced Multi-Objective Optimization Algorithms
  • Sentiment Analysis and Opinion Mining
  • Image and Video Quality Assessment
  • Generative Adversarial Networks and Image Synthesis

Politecnico di Milano
2019-2022

Abstract New items, also called cold-start are introduced every day in the catalogs of numerous online systems. Due to absence previous preferences, recommending these items is difficult but important task for a recommender system. For this reason, item recommendation problem still represents an interesting research topic community. In work, we propose Neural Feature Combiner ( NFC ), novel deep learning, item-based approach recommendation. The model learns map content features into...

10.1007/s11257-021-09303-w article EN cc-by User Modeling and User-Adapted Interaction 2021-10-20

In this paper we provide a description of the methods used as team BanaNeverAlone for ACM RecSys Challenge 2020, organized by Twitter. The challenge addresses problem user engagement prediction: goal is to predict probability (Like, Reply, Retweet or with comment), based on series past interactions Twitter platform. Our proposed solution relies several features that extracted from original dataset, well consolidated models, such gradient boosting decision trees and neural networks. ensemble...

10.1145/3415959.3415998 article EN 2020-09-25

This paper focuses on recommender systems based item-item collaborative filtering (CF). Although research item-based methods is not new, current literature does provide any reliable insight how to estimate confidence of recommendations. The goal this fill gap, by investigating the conditions under which recommendations will succeed or fail for a specific user. We formalize CF problem as an eigenvalue problem, where estimated ratings are equivalent true (unknown) multiplied user-specific...

10.1145/3320435.3320453 article EN 2019-06-07

In this paper we provide an overview of the approach used as team PoliCloud8 for ACM RecSys Challenge 2019. The competition, organized by Trivago, focuses on problem session-based and context-aware accommodation recommendation in a travel domain. goal is to suggest suitable accommodations fitting needs traveller maximise chance redirect (click-out) booking site, relying explicit implicit user signals within session (clicks, search refinement, filter usage) detect users intent. Our proposes...

10.1145/3359555.3359563 article EN 2019-09-20

Cold-start is a very common and still open problem in the Recommender Systems literature. Since cold start items do not have any interaction, collaborative algorithms are applicable. One of main strategies to use pure or hybrid content-based approaches, which usually yield lower recommendation quality than ones. Some techniques optimize performance this type approaches been studied recent past. them called feature weighting, assigns every real value, weight, that estimates its importance....

10.48550/arxiv.1808.10664 preprint EN other-oa arXiv (Cornell University) 2018-01-01

This work presents a comprehensive study, from an industrial perspective, of the process between collection raw data, and generation next-item recommendation, in domain Video-on-Demand (VoD). Most research papers focus their efforts on analyzing recommender systems already-processed datasets, but they do not face same challenges that occur naturally industry, e.g., processing interactions logs to create datasets for testing. paper describes whole data including cleaning, processing, feature...

10.1109/access.2022.3148434 article EN cc-by IEEE Access 2022-01-01

Most state-of-the-art top-N collaborative recommender systems work by learning embeddings to jointly represent users and items. Learned are considered be effective solve a variety of tasks. Among others, providing explaining recommendations. In this paper we question the reliability learned Matrix Factorization (MF). We empirically demonstrate that, simply changing initial values assigned latent factors, same MF method generates very different items users, highlight that effect is stronger...

10.1145/3412841.3442011 article EN 2021-03-22

In this paper we provide an overview of the approach used as team Trial&Error for ACM RecSys Challenge 2021. The competition, organized by Twitter, addresses problem predicting different categories user engagements (Like, Reply, Retweet and with Comment), given a dataset previous interactions on Twitter platform. Our proposed method relies efficiently leveraging massive amount data, crafting wide variety features designing lightweight solution. This results in significant reduction...

10.1145/3487572.3487597 article EN 2021-10-01

Hyper-parameter optimisation (HPO) is a fundamental task that must be performed in order to achieve the highest accuracy performance recommendation algorithm can provide. In recent past, with growth of dataset sizes, amount resources and time needed perform dramatically increased. Sampling data used during HPO procedure allows reducing required resources, but it impacts metric score. this paper, we study effects optimising hyper-parameters through random search, sampling users dataset. The...

10.1145/3477314.3507158 article EN Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing 2022-04-25

This paper presents the solution designed by team "Boston Team Party" for ACM RecSys Challenge 2022. The competition was organized Dressipi and framed under session-based fashion recommendations domain. Particularly, task to predict purchased item at end of each anonymous session. Our proposed two-stage is effective, lightweight, scalable. First, it leverages expertise several strong recommendation models produce a pool candidate items. Then, Gradient-Boosting Decision Tree model aggregates...

10.1145/3556702.3556829 article EN 2022-09-16

Most state-of-the-art top-N collaborative recommender systems work by learning embeddings to jointly represent users and items. Learned are considered be effective solve a variety of tasks. Among others, providing explaining recommendations. In this paper we question the reliability learned Matrix Factorization (MF). We empirically demonstrate that, simply changing initial values assigned latent factors, same MF method generates very different items users, highlight that effect is stronger...

10.48550/arxiv.2104.05796 preprint EN cc-by arXiv (Cornell University) 2021-01-01

This paper describes the solution of our team PolimiRank for WSDM Cup 2022 on cross-market recommendation. The goal competition is to effectively exploit information extracted from different markets improve ranking accuracy recommendations two target markets. Our model consists in a multi-stage approach based combination data belonging In first stage, state-of-the-art recommenders are used predict scores user-item couples, which ensembled following 2 stages, employing simple linear and more...

10.48550/arxiv.2202.08824 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Adding confidence estimates to predicted ratings has been shown positively influence the quality of recommendations provided by a recommender system. While over single point predictions and preferences widely studied in literature, limited effort put exploring benefits user-level indices. In this work we exploit recently introduced index, called eigenvalue order provide maximum for item-based systems. We firstly derive closed form solution calculate then propose new recommendation...

10.1145/3460231.3478862 article EN 2021-09-13
Coming Soon ...