Junzhou Zhao

Junzhou Zhao

Auto-generated profile, based on publicly available information

Junzhou Zhao

MOE Key Laboratory for Intelligent Networks and Network Security, Xian Jiaotong University, Xian, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Jie MaJie Ma
Jie Ma
PWPinghui Wang
Pinghui Wang
DKDechen Kong
Dechen Kong
ZWZewei Wang
Zewei Wang
Jun LiuJun Liu
Jun Liu
JZJunzhou Zhao
Junzhou Zhao
Visual question answering requires a system to provide an accurate natural language answer given an image and a natural language question. However, it is widely recognized that previous generic VQA methods often tend to memorize biases present in the training data rather than learning proper behaviors, such as grounding images before predicting answers. Therefore, these methods usually achieve high in-distribution but poor out-of-distribution performance. In recent years, various datasets and debiasing methods have been proposed to evaluate and enhance the VQA robustness, respectively. This paper provides the first comprehensive survey focused on this emerging fashion. Specifically, we first provide an overview of the development process of datasets from in-distribution and out-of-distribution perspectives. Then, we examine the evaluation metrics employed by these datasets. Third, we propose a typology that presents the development process, similarities and differences, robustness comparison, and technical features of existing debiasing methods. Furthermore, we analyze and discuss the robustness of representative vision-and-language pre-training models on VQA. Finally, through a thorough review of the available literature and experimental analysis, we discuss the key areas for future research from various viewpoints.

3 December 2013 in IEEE Internet Computing
Verified
Journal Article
Closed access
PWPinghui Wang
Pinghui Wang
WHWenbo He
Wenbo He
JZJunzhou Zhao
Junzhou Zhao
Despite recent efforts to characterize online social network (OSN) structures and activities, user behavior across different OSNs has received little attention. Yet such information could provide insight into issues relating to personal privacy protection. For instance, many Foursquare users reveal their Facebook and Twitter accounts to the public. The authors' in-depth measurement study examines users' network activities and privacy settings across Facebook, Twitter, and Foursquare. Results show that user activities are highly correlated among these three OSNs, which causes information leakage for a large fraction of Foursquare users.

1 July 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YWYujun Wang
Yujun Wang
XHXiaopeng Hong
Xiaopeng Hong
YWYabin Wang
Yabin Wang
JZJunzhou Zhao
Junzhou Zhao
Guanghui SunGuanghui Sun
Guanghui Sun
BQBaoxing Qin
Baoxing Qin

26 November 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
NXNuo Xu
Nuo Xu
PWPinghui Wang
Pinghui Wang
JZJunzhou Zhao
Junzhou Zhao
FSFeiyang Sun
Feiyang Sun
LLLin Lan
Lin Lan
XGXiaohong Guan
Xiaohong Guan
Legal Judgment Prediction (LJP) aims to automatically predict a law case’s judgment results based on the text description of its facts. In practice, the confusing law articles (or charges) problem frequently occurs, reflecting that the law cases applicable to similar articles (or charges) tend to be misjudged. Although some recent works based on prior knowledge solve this issue well, they ignore that confusion also occurs between law articles with a high posterior semantic similarity due to the data imbalance problem instead of only between the prior highly similar ones, which is this work’s further finding. This article proposes an end-to-end model named D-LADAN to solve the above challenges. On the one hand, D-LADAN constructs a graph among law articles based on their text definition and proposes a graph distillation operator (GDO) to distinguish the ones with a high prior semantic similarity. On the other hand, D-LADAN presents a novel momentum-updated memory mechanism to dynamically sense the posterior similarity between law articles (or charges) and a weighted GDO to adaptively capture the distinctions for revising the inductive bias caused by the data imbalance problem. We perform extensive experiments to demonstrate that D-LADAN significantly outperforms state-of-the-art methods in accuracy and robustness.

29 January 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PWPinghui Wang
Pinghui Wang
DXDongdong Xie
Dongdong Xie
JZJunzhou Zhao
Junzhou Zhao
JLJinsong Li
Jinsong Li
ZLZhicheng Li
Zhicheng Li
JDJia Di
Jia Di
Calculating the number of distinct values (i.e., NDV) in a column of a big table is costly yet fundamental to a variety of database applications such as data compression and profiling. To reduce the high time and space cost, a number of sketch methods (e.g., HyperLogLog) have been proposed, which estimate the NDV from a constructed compact data summary of distinct values. However, these methods fail or are costly to manage fully-dynamic scenarios where data is often inserted into and deleted from the table. To solve this issue, we propose a novel sketch method, Half-Xor . Our Half-Xor sketch consists of a compact bit matrix and a small counter array, and it needs to set a few bits and update a counter when handling a data insertion/deletion. Compared with the state-of-the-art mergeable method, our experimental results demonstrate that our method Half-Xor is up to 6.6 times more accurate under the same memory usage and reduces the memory usage by up to 16 times to achieve the same estimation accuracy.

26 May 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
PWPinghui Wang
Pinghui Wang
CYChengjin Yang
Chengjin Yang
DXDongdong Xie
Dongdong Xie
JZJunzhou Zhao
Junzhou Zhao
HLHui Li
Hui Li
XGXiaohong Guan
Xiaohong Guan
Counting the number of distinct elements distributed over multiple data holders is a fundamental problem with many real-world applications ranging from crowd counting to network monitoring. Although a number of space and computationally efficient sketch methods (e.g., the Flajolet-Martin sketch and the HyperLogLog sketch) for cardinality estimation have been proposed to solve the above problem, these sketch methods are insecure when considering privacy concerns related to the use of each data holder's personal dataset. Despite a recently proposed protocol that successfully implements the well-known Flajolet-Martin (FM) sketch on a secret-sharing based multiparty computation (MPC) framework for solving the problem of private distributed cardinality estimation (PDCE), we observe that this MPC-FM protocol is not differentially private. In addition, the MPC-FM protocol is computationally expensive, which limits its applications to data holders with limited computation resources. To address the above issues, in this paper we propose a novel protocol DP-DICE, which is computationally efficient and differentially private for solving the problem of PDCE. Experimental results show that our DP-DICE achieves orders of magnitude speedup and reduces the estimation error by several times in comparison with state-of-the-arts under the same security requirements.