default search action
Guangyi Zhang 0001
Person information
- affiliation: KTH Royal Institute of Technology, Stockholm, Sweden
Other persons with the same name
- Guangyi Zhang — disambiguation page
- Guangyi Zhang 0002 — South China University of Technology, Guangzhou, China
- Guangyi Zhang 0003
— Queen's University, Kingston, ON, Canada
- Guangyi Zhang 0004 — Jiangsu University of Science and Technology, Zhenjiang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [c6]Guangyi Zhang
Efficient and Practical Approximation Algorithms for Advertising in Content Feeds. WWW 2025: 3193-3203 - [i9]Guangyi Zhang, Ilie Sarpe, Aristides Gionis:
Efficient and Practical Approximation Algorithms for Advertising in Content Feeds. CoRR abs/2502.02115 (2025) - 2024
- [j4]Wenfei Fan
Discovering Top-k Relevant and Diversified Rules. Proc. ACM Manag. Data 2(4): 195:1-195:28 (2024) - 2023
- [j3]Guangyi Zhang
Regularized impurity reduction: accurate decision trees with complexity guarantees. Data Min. Knowl. Discov. 37(1): 434-475 (2023) - [c5]Guangyi Zhang
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. KDD 2023: 3229-3238 - [c4]Guangyi Zhang, Nikolaj Tatti
Ranking with submodular functions on the fly. SDM 2023: 604-612 - [i8]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on the fly. CoRR abs/2301.06787 (2023) - [i7]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. CoRR abs/2307.02946 (2023) - 2022
- [b1]Guangyi Zhang:
Optimization beyond a single submodular function: Submodular optimization for ranking, decision trees and diversity. Royal Institute of Technology, Stockholm, Sweden, 2022 - [j2]Guangyi Zhang
Ranking with submodular functions on a budget. Data Min. Knowl. Discov. 36(3): 1197-1218 (2022) - [c3]Guangyi Zhang, Nikolaj Tatti
Coresets remembered and items forgotten: submodular maximization with deletions. ICDM 2022: 676-685 - [i6]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Optimal deletion-robust coreset for submodular maximization. CoRR abs/2203.01241 (2022) - [i5]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on a budget. CoRR abs/2204.04168 (2022) - [i4]Guangyi Zhang, Aristides Gionis:
Regularized impurity reduction: Accurate decision trees with complexity guarantees. CoRR abs/2208.10949 (2022) - 2021
- [j1]Guangyi Zhang
Errors-in-Variables Modeling of Personalized Treatment-Response Trajectories. IEEE J. Biomed. Health Informatics 25(1): 201-208 (2021) - 2020
- [c2]Guangyi Zhang, Aristides Gionis:
Diverse Rule Sets. KDD 2020: 1532-1541 - [c1]Guangyi Zhang, Aristides Gionis:
Maximizing diversity over clustered data. SDM 2020: 649-657 - [i3]Guangyi Zhang, Aristides Gionis:
Maximizing diversity over clustered data. CoRR abs/2001.03050 (2020) - [i2]Guangyi Zhang, Aristides Gionis:
Diverse Rule Sets. CoRR abs/2006.09890 (2020)
2010 – 2019
- 2019
- [i1]Guangyi Zhang, Reza A. Ashrafi, Anne Juuti, Kirsi Pietiläinen, Pekka Marttinen:
Errors-in-variables Modeling of Personalized Treatment-Response Trajectories. CoRR abs/1906.03989 (2019)
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 2025-11-13 00:24 CET 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: