default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Ruffini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Jan Malte Lichtenberg
, Giuseppe Di Benedetto, Matteo Ruffini:
Ranking Across Different Content Types: The Robust Beauty of Multinomial Blending. RecSys 2024: 823-825- [i8]Jan Malte Lichtenberg, Giuseppe Di Benedetto, Matteo Ruffini:
Ranking Across Different Content Types: The Robust Beauty of Multinomial Blending. CoRR abs/2408.09168 (2024) - 2023
- [c6]Giuseppe Di Benedetto, Alexander Buchholz, Ben London, Matej Jakimov, Yannik Stein, Jan Malte Lichtenberg, Vito Bellini, Matteo Ruffini, Thorsten Joachims:
Contextual Position Bias Estimation Using a Single Stochastic Logging Policy. LERI@RecSys 2023: 55-61 - [i7]Jan Malte Lichtenberg, Alexander Buchholz, Giuseppe Di Benedetto, Matteo Ruffini, Ben London:
Double Clipping: Less-Biased Variance Reduction in Off-Policy Evaluation. CoRR abs/2309.01120 (2023) - 2022
- [c5]Matteo Ruffini, Vito Bellini, Alexander Buchholz, Giuseppe Di Benedetto, Yannik Stein:
Modeling Position Bias Ranking for Streaming Media Services. WWW (Companion Volume) 2022: 72-76 - [c4]Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto, Yannik Stein, Matteo Ruffini, Fabian Moerchen:
Fair Effect Attribution in Parallel Online Experiments. WWW (Companion Volume) 2022: 77-83 - [i6]Alexander Buchholz, Jan Malte Lichtenberg, Giuseppe Di Benedetto, Yannik Stein, Vito Bellini, Matteo Ruffini:
Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling. CoRR abs/2205.06024 (2022) - [i5]Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto, Yannik Stein, Matteo Ruffini, Fabian Moerchen:
Fair Effect Attribution in Parallel Online Experiments. CoRR abs/2210.08338 (2022) - 2021
- [i4]Oriol Barbany Mayor, Vito Bellini, Alexander Buchholz, Giuseppe Di Benedetto, Diego Marco Granziol, Matteo Ruffini, Yannik Stein:
Ranker-agnostic Contextual Position Bias Estimation. CoRR abs/2107.13327 (2021)
2010 – 2019
- 2019
- [b1]Matteo Ruffini:
Learning latent variable models: efficient algorithms and applications. Polytechnic University of Catalonia, Spain, 2019 - 2018
- [j1]Matteo Ruffini, Marta Casanellas, Ricard Gavaldà:
A new method of moments for latent variable models. Mach. Learn. 107(8-10): 1431-1455 (2018) - [i3]Laura Aviñó, Matteo Ruffini, Ricard Gavaldà:
Generating Synthetic but Plausible Healthcare Record Datasets. CoRR abs/1807.01514 (2018) - [i2]Matteo Ruffini, Guillaume Rabusseau, Borja Balle:
Hierarchical Methods of Moments. CoRR abs/1810.07468 (2018) - 2017
- [c3]Matteo Ruffini, Ricard Gavaldà, Esther Limon:
Clustering Patients with Tensor Decomposition. MLHC 2017: 126-146 - [c2]Matteo Ruffini, Guillaume Rabusseau, Borja Balle:
Hierarchical Methods of Moments. NIPS 2017: 1901-1911 - [i1]Matteo Ruffini, Ricard Gavaldà, Esther Limon:
Clustering Patients with Tensor Decomposition. CoRR abs/1708.08994 (2017) - 2012
- [c1]Pasqualina Fragneto, Andrea Fusiello, Beatrice Rossi, Luca Magri, Matteo Ruffini:
Uncalibrated View Synthesis with Homography Interpolation. 3DIMPVT 2012: 270-277
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
