default search action
Han Zhu 0001
Person information
- affiliation: Alibaba Group, Beijing, China
Other persons with the same name
- Han Zhu — disambiguation page
- Han Zhu 0003 — Tencent Media Lab, Shenzhen, China (and 1 more)
- Han Zhu 0004 — Chinese Academy of Sciences, Institute of Acoustics, Key Laboratory of Speech Acoustics and Content Understanding, Beijing, China (and 1 more)
- Han Zhu 0005 — Macao Polytechnic University, Faculty of Applied Sciences, China
- Han Zhu 0006 — Dongbei University of Finance and Economics, School of Management Science and Engineering, Dalian, China (and 1 more)
- Han Zhu 0007 — Tsinghua University, Tsinghua National Lab for Information Science and Technology, TNList, Beijing, China
- Han Zhu 0008 — Shanghai Jiao Tong University, Basics Lab, Department of Computer Science, China
- Han Zhu 0009 — East China Normal University, School of Computer Science and Technology, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Xiang-Rong Sheng, Feifan Yang, Litong Gong, Biao Wang, Zhangming Chan, Yujing Zhang, Yueyao Cheng, Yong-Nan Zhu, Tiezheng Ge, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
Enhancing Taobao Display Advertising with Multimodal Representations: Challenges, Approaches and Insights. CIKM 2024: 4858-4865 - [i15]Xiang-Rong Sheng, Feifan Yang, Litong Gong, Biao Wang, Zhangming Chan, Yujing Zhang, Yueyao Cheng, Yong-Nan Zhu, Tiezheng Ge, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
Enhancing Taobao Display Advertising with Multimodal Representations: Challenges, Approaches and Insights. CoRR abs/2407.19467 (2024) - 2023
- [c13]Jingyue Gao, Shuguang Han, Han Zhu, Siran Yang, Yuning Jiang, Jian Xu, Bo Zheng:
Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao. CIKM 2023: 4574-4580 - [c12]Jiacen Hu, Zhangming Chan, Yu Zhang, Shuguang Han, Siyuan Lou, Baolin Liu, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
PS-SA: An Efficient Self-Attention via Progressive Sampling for User Behavior Sequence Modeling. CIKM 2023: 4639-4645 - [c11]Zhishan Zhao, Jingyue Gao, Yu Zhang, Shuguang Han, Siyuan Lou, Xiang-Rong Sheng, Zhe Wang, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
COPR: Consistency-Oriented Pre-Ranking for Online Advertising. CIKM 2023: 4974-4980 - [c10]Ruiming Tang, Xiaoqiang Zhu, Junfeng Ge, Kuang-chih Lee, Biye Jiang, Xingxing Wang, Han Zhu, Tao Zhuang, Weiwen Liu, Kan Ren, Weinan Zhang, Xiangyu Zhao:
International Workshop on Deep Learning Practice for High-Dimensional Sparse Data with RecSys 2023. RecSys 2023: 1276-1280 - [i14]Zhishan Zhao, Jingyue Gao, Yu Zhang, Shuguang Han, Siyuan Lou, Xiang-Rong Sheng, Zhe Wang, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
COPR: Consistency-Oriented Pre-Ranking for Online Advertising. CoRR abs/2306.03516 (2023) - [i13]Jingyue Gao, Shuguang Han, Han Zhu, Siran Yang, Yuning Jiang, Jian Xu, Bo Zheng:
Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao. CoRR abs/2306.03527 (2023) - [i12]Minfang Lu, Yuchen Jiang, Huihui Dong, Qi Li, Ziru Xu, Yuanlin Liu, Lixia Wu, Haoyuan Hu, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng:
Robust Representation Learning for Unified Online Top-K Recommendation. CoRR abs/2310.15492 (2023) - 2022
- [c9]Rihan Chen, Bin Liu, Han Zhu, Yaoxuan Wang, Qi Li, Buting Ma, Qingbo Hua, Jun Jiang, Yunlong Xu, Hongbo Deng, Bo Zheng:
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation. CIKM 2022: 3013-3022 - [c8]Yuchen Jiang, Qi Li, Han Zhu, Jinbei Yu, Jin Li, Ziru Xu, Huihui Dong, Bo Zheng:
Adaptive Domain Interest Network for Multi-domain Recommendation. CIKM 2022: 3212-3221 - [c7]Roberto Corizzo, Junfeng Ge, Colin Bellinger, Xiaoqiang Zhu, Paula Branco, Kuang-chih Lee, Nathalie Japkowicz, Ruiming Tang, Tao Zhuang, Han Zhu, Biye Jiang, Jiaxin Mao, Weinan Zhang:
4th Workshop on Deep Learning Practice and Theory for High-Dimensional Sparse and Imbalanced Data with KDD 2022. KDD 2022: 4860-4861 - [c6]Siguang Huang, Yunli Wang, Lili Mou, Huayue Zhang, Han Zhu, Chuan Yu, Bo Zheng:
MBCT: Tree-Based Feature-Aware Binning for Individual Uncertainty Calibration. WWW 2022: 2236-2246 - [i11]Siguang Huang, Yunli Wang, Lili Mou, Huayue Zhang, Han Zhu, Chuan Yu, Bo Zheng:
MBCT: Tree-Based Feature-Aware Binning for Individual Uncertainty Calibration. CoRR abs/2202.04348 (2022) - [i10]Rihan Chen, Bin Liu, Han Zhu, Yaoxuan Wang, Qi Li, Buting Ma, Qingbo Hua, Jun Jiang, Yunlong Xu, Hongbo Deng, Bo Zheng:
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation. CoRR abs/2202.10226 (2022) - [i9]Jingwei Zhuo, Bin Liu, Xiang Li, Han Zhu, Xiaoqiang Zhu:
WSLRec: Weakly Supervised Learning for Neural Sequential Recommendation Models. CoRR abs/2202.13616 (2022) - [i8]Yuchen Jiang, Qi Li, Han Zhu, Jinbei Yu, Jin Li, Ziru Xu, Huihui Dong, Bo Zheng:
Adaptive Domain Interest Network for Multi-domain Recommendation. CoRR abs/2206.09672 (2022) - 2021
- [i7]Jin Li, Jie Liu, Shangzhou Li, Yao Xu, Ran Cao, Qi Li, Biye Jiang, Guan Wang, Han Zhu, Kun Gai, Xiaoqiang Zhu:
Truncation-Free Matching System for Display Advertising at Alibaba. CoRR abs/2102.09283 (2021) - [i6]Daqing Chang, Jintao Liu, Ziru Xu, Han Li, Han Zhu, Xiaoqiang Zhu:
Context-aware Tree-based Deep Model for Recommender Systems. CoRR abs/2109.10602 (2021) - 2020
- [c5]Jingwei Zhuo, Ziru Xu, Wei Dai, Han Zhu, Han Li, Jian Xu, Kun Gai:
Learning Optimal Tree Models under Beam Search. ICML 2020: 11650-11659 - [i5]Jingwei Zhuo, Ziru Xu, Wei Dai, Han Zhu, Han Li, Jian Xu, Kun Gai:
Learning Optimal Tree Models Under Beam Search. CoRR abs/2006.15408 (2020)
2010 – 2019
- 2019
- [c4]Han Zhu, Daqing Chang, Ziru Xu, Pengye Zhang, Xiang Li, Jie He, Han Li, Jian Xu, Kun Gai:
Joint Optimization of Tree-based Index and Deep Model for Recommender Systems. NeurIPS 2019: 3973-3982 - [i4]Han Zhu, Daqing Chang, Ziru Xu, Pengye Zhang, Xiang Li, Jie He, Han Li, Jian Xu, Kun Gai:
Joint Optimization of Tree-based Index and Deep Model for Recommender Systems. CoRR abs/1902.07565 (2019) - 2018
- [c3]Guorui Zhou, Xiaoqiang Zhu, Chengru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, Kun Gai:
Deep Interest Network for Click-Through Rate Prediction. KDD 2018: 1059-1068 - [c2]Han Zhu, Xiang Li, Pengye Zhang, Guozheng Li, Jie He, Han Li, Kun Gai:
Learning Tree-based Deep Model for Recommender Systems. KDD 2018: 1079-1088 - [i3]Han Zhu, Pengye Zhang, Guozheng Li, Jie He, Han Li, Kun Gai:
Learning Tree-based Deep Model for Recommender Systems. CoRR abs/1801.02294 (2018) - 2017
- [c1]Han Zhu, Junqi Jin, Chang Tan, Fei Pan, Yifan Zeng, Han Li, Kun Gai:
Optimized Cost per Click in Taobao Display Advertising. KDD 2017: 2191-2200 - [i2]Han Zhu, Junqi Jin, Chang Tan, Fei Pan, Yifan Zeng, Han Li, Kun Gai:
Optimized Cost per Click in Taobao Display Advertising. CoRR abs/1703.02091 (2017) - [i1]Guorui Zhou, Chengru Song, Xiaoqiang Zhu, Xiao Ma, Yanghui Yan, Xingya Dai, Han Zhu, Junqi Jin, Han Li, Kun Gai:
Deep Interest Network for Click-Through Rate Prediction. CoRR abs/1706.06978 (2017)
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-11-15 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint