default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrian Brost
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j1]Pan Li
, Brian Brost, Alexander Tuzhilin:
Adversarial Learning for Cross Domain Recommendations. ACM Trans. Intell. Syst. Technol. 14(1): 5:1-5:25 (2023)
Conference and Workshop Papers
- 2021
- [c9]Christian Hansen, Rishabh Mehrotra, Casper Hansen, Brian Brost, Lucas Maystre, Mounia Lalmas:
Shifting Consumption towards Diverse Content on Music Streaming Platforms. WSDM 2021: 238-246 - 2020
- [c8]Federico Tomasi, Rishabh Mehrotra, Aasish Pappu, Judith Bütepage, Brian Brost, Hugo Galvão, Mounia Lalmas:
Query Understanding for Surfacing Under-served Music Content. CIKM 2020: 2765-2772 - [c7]Gabriel Meseguer-Brocal, Rachel M. Bittner, Simon Durand, Brian Brost:
Data Cleansing with Contrastive Learning for Vocal Note Event Annotations. ISMIR 2020: 255-262 - [c6]James McInerney, Brian Brost, Praveen Chandar, Rishabh Mehrotra, Benjamin A. Carterette:
Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions. KDD 2020: 1779-1788 - [c5]Casper Hansen, Christian Hansen, Lucas Maystre, Rishabh Mehrotra, Brian Brost, Federico Tomasi, Mounia Lalmas:
Contextual and Sequential User Embeddings for Large-Scale Music Recommendation. RecSys 2020: 53-62 - 2019
- [c4]Brian Brost, Rishabh Mehrotra, Tristan Jehan:
The Music Streaming Sessions Dataset. WWW 2019: 2594-2600 - 2017
- [c3]Brian Brost:
Multileaving for Online Evaluation of Rankers. LEARNER@ICTIR 2017 - 2016
- [c2]Brian Brost, Yevgeny Seldin, Ingemar J. Cox, Christina Lioma:
Multi-Dueling Bandits and Their Application to Online Ranker Evaluation. CIKM 2016: 2161-2166 - [c1]Brian Brost, Ingemar J. Cox, Yevgeny Seldin, Christina Lioma:
An Improved Multileaving Algorithm for Online Ranker Evaluation. SIGIR 2016: 745-748
Informal and Other Publications
- 2020
- [i5]James McInerney, Brian Brost, Praveen Chandar, Rishabh Mehrotra, Ben Carterette:
Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions. CoRR abs/2007.12986 (2020) - [i4]Gabriel Meseguer-Brocal, Rachel M. Bittner, Simon Durand, Brian Brost:
Data Cleansing with Contrastive Learning for Vocal Note Event Annotations. CoRR abs/2008.02069 (2020) - 2019
- [i3]Brian Brost, Rishabh Mehrotra, Tristan Jehan:
The Music Streaming Sessions Dataset. CoRR abs/1901.09851 (2019) - 2016
- [i2]Brian Brost, Ingemar J. Cox, Yevgeny Seldin, Christina Lioma:
An Improved Multileaving Algorithm for Online Ranker Evaluation. CoRR abs/1608.00788 (2016) - [i1]Brian Brost, Yevgeny Seldin, Ingemar J. Cox, Christina Lioma:
Multi-Dueling Bandits and Their Application to Online Ranker Evaluation. CoRR abs/1608.06253 (2016)
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-04-24 23:16 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:
