Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhen Mao

dblp:12/7249 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-8054-9797ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Transfer learning and domain adaptation · 40% Learning paradigms · 40% Trustworthy machine learning · 20%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.812024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition · ICML 2024
Machine learning › Transfer learning and domain adaptation
label shift
0.812024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition · ICML 2024
Machine learning › Transfer learning and domain adaptation › label shift
label shift correction
0.812024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition · ICML 2024
Machine learning › Learning paradigms › class imbalance
long-tailed learning
0.812024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition · ICML 2024
Machine learning › Learning paradigms › long-tailed recognition
test-agnostic long-tailed recognition
0.812024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition · ICML 2024
Smart cities and intelligent transportation › logistics
on-demand delivery
0.412020
Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020
Mathematical optimization › discrete optimization
binary integer programming
0.112020
Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020
Mathematical optimization
combinatorial optimization
0.112020
Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020

Methods — techniques the papers use, named apart from their topics

spatial computational techniques · 1.3machine learning · 1.3heuristic search · 1.3data mining · 1.3branch-and-bound · 1.3label shift correction · 0.8black box shift estimation · 0.8
YearPublicationVenuePosition
2025 An efficient multi-party signature for securing blockchain wallet
Yazhou Wang 0006, Guozhu Liu, Zhen Mao
Peer Peer Netw. Appl.6
2024 Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition
abstract
Long-tail learning primarily focuses on mitigating the label distribution shift between long-tailed training data and uniformly distributed test data. However, in real-world applications, we often encounter a more intricate challenge where the test label distribution is agnostic. To address this problem, we first theoretically establish the substantial potential for reducing the generalization error if we can precisely estimate the test label distribution. Motivated by the theoretical insight, we introduce a simple yet effective solution called label shift correction (LSC). LSC estimates the test label distribution within the proposed framework of generalized black box shift estimation, and adjusts the predictions from a pre-trained model to align with the test distribution. Theoretical analyses confirm that accurate estimation of test label distribution can effectively reduce the generalization error. Extensive experimental results demonstrate that our method significantly outperforms previous state-of-the-art approaches, especially when confronted with non-uniform test label distribution. Notably, the proposed method is general and complements existing long-tail learning approaches, consistently improving their performance. The source code is available at https://github.com/Stomach-ache/label-shift-correction
Tong Wei 0001, Zhen Mao, Zi-Hao Zhou, Yuanyu Wan, Min-Ling Zhang
ICML2
2023 A novel blockchain's private key generation mechanism based on facial biometrics and physical unclonable function
Yazhou Wang 0006, Yan Zhang 0097, Guozhu Liu, Zhen Mao
J. Inf. Secur. Appl.7
2020 Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service
abstract
Recently on-demand food delivery service has become very popular in China. More than 30 million orders are placed by eaters of Meituan-Dianping everyday. Delicacies are delivered to eaters in 30 minutes on average. To fully leverage the ability of our couriers and restaurants, delivery scope is proposed as an infrastructure product for on-demand food delivery area. A delivery scope based retrieval system is designed and built on our platform. In order to draw suitable delivery scopes for millions of restaurant partners, we propose a pioneering delivery scope generation framework. In our framework, a single delivery scope generation algorithm is proposed by using spatial computational techniques and data mining techniques. Moreover, a scope scoring algorithm and decision algorithm are proposed by utilizing machine learning models and combinatorial optimization techniques. Specifically, we propose a novel delivery scope sample generation method and use the scope related features to estimate order numbers and average delivery time in a period of time for each delivery scope. Then we formalize the candidate scopes selection process as a binary integer programming problem. Both branch&bound algorithm and a heuristic search algorithm are integrated in our system. Results of online experiments show that scopes generated by our new algorithm significantly outperform manual generated ones. Our algorithm brings more orders without hurt of users' experience. After deployed online, our system has saved thousands of hours for operation staff, and it is considered to be one of the most useful operation tools to balance demand of eaters and supply of restaurants and couriers.
Xuetao Ding, Runfeng Zhang, Zhen Mao, Fangxiao Du, Guoxing Wei, Feifan Yin, Renqing He, Zhizhao Sun
KDD3
1995 Knowledge based identification of fractionally sampled channels
abstract
Blind channel identification has been a popular research subject in recent years. We introduce the concept of knowledge-based blind channel identification. By relying on known information such as the pulse shaping filter and the antialiasing filter responses, the performance of channel identification and equalization can be significantly enhanced in digital communication systems. We present two simple methods: one in time-domain and one in frequency domain. Our simulation results demonstrate the performance of these two approaches.
Zhi Ding 0001, Zhen Mao
ICASSP2