![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Chang Li 0003
Person information
- affiliation: University of Amsterdam, The Netherlands
Other persons with the same name
- Chang Li — disambiguation page
- Chang Li 0001
— Hefei University of Technology, Department of Biomedical Engineering, China (and 1 more)
- Chang Li 0002
— Hong Kong University of Science and Technology, Hong Kong
- Chang Li 0004
— Central China Normal University, College of Urban and Environmental Science, Wuhan, China
- Chang Li 0005 — Purdue University, Department of Computer Science, West Lafayette, IN, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j3]Chang Li
, Ilya Markov, Maarten de Rijke
, Masrour Zoghi:
MergeDTS: A Method for Effective Large-Scale Online Ranker Evaluation. ACM Trans. Inf. Syst. 38(4): 40:1-40:28 (2020) - [c3]Chang Li, Haoyun Feng, Maarten de Rijke
:
Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity. RecSys 2020: 33-42
2010 – 2019
- 2019
- [j2]Bingbing Jiang
, Chang Li, Maarten de Rijke
, Xin Yao, Huanhuan Chen
:
Probabilistic Feature Selection and Classification Vector Machine. ACM Trans. Knowl. Discov. Data 13(2): 21:1-21:27 (2019) - [c2]Chang Li, Maarten de Rijke
:
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model. IJCAI 2019: 2859-2865 - [c1]Chang Li, Branislav Kveton, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvári, Masrour Zoghi:
BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback. UAI 2019: 196-206 - [i7]Chang Li, Maarten de Rijke:
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model. CoRR abs/1905.12370 (2019) - [i6]Chang Li, Haoyun Feng, Maarten de Rijke:
A Contextual-Bandit Approach to Online Learning to Rank for Relevance and Diversity. CoRR abs/1912.00508 (2019) - 2018
- [j1]Chang Li
, Maarten de Rijke
:
Incremental sparse Bayesian ordinal regression. Neural Networks 106: 294-302 (2018) - [i5]Branislav Kveton, Chang Li, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvári, Masrour Zoghi:
BubbleRank: Safe Online Learning to Rerank. CoRR abs/1806.05819 (2018) - [i4]Chang Li, Maarten de Rijke:
Incremental Sparse Bayesian Ordinal Regression. CoRR abs/1806.06553 (2018) - [i3]Chang Li, Ilya Markov, Maarten de Rijke, Masrour Zoghi:
Merge Double Thompson Sampling for Large Scale Online Ranker Evaluation. CoRR abs/1812.04412 (2018) - [i2]Chang Li, Artem Grotov, Ilya Markov, Bryan Eikema, Maarten de Rijke:
Online Learning to Rank with List-level Feedback for Image Filtering. CoRR abs/1812.04910 (2018) - 2016
- [i1]Chang Li, Huanhuan Chen, Xin Yao:
Probabilistic Feature Selection and Classification Vector Machine. CoRR abs/1609.05486 (2016)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-06 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint