Jing Tao

Prof. Jing Tao


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
4 November 2023 in Colloids and Surfaces A: Physicochemical and Engineering Aspects
Verified
Journal Article
Closed access
FGFucheng Guan
Fucheng Guan
JTJing Tao
Jing Tao
QYQiang Yao
Qiang Yao
ZLZheng Li
Zheng Li
YZYihang Zhang
Yihang Zhang
YLYuanfa Liu
Yuanfa Liu

24 February 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PJPeng Jia
Peng Jia
PWPinghui Wang
Pinghui Wang
YZYuchao Zhang
Yuchao Zhang
XZXiangliang Zhang
Xiangliang Zhang
JTJing Tao
Jing Tao
DTDon Towsley
Don Towsley
Online monitoring user cardinalities in graph streams is fundamental for many applications such as anomaly detection. These graph streams may contain edge duplicates and have a large number of user-item pairs, which makes it infeasible to exactly compute user cardinalities due to limited computational and memory resources. Existing methods are designed to approximately estimate user cardinalities, but their accuracy highly depends on complex parameters and they cannot provide anytime-available estimation. To address these problems, we develop novel bit/register sharing algorithms, which use a bit/register array to build a compact sketch of all users' connected items. Our algorithms exploit the dynamic properties of the bit/register arrays (e.g., the fraction of zero bits in the bit array) to significantly improve the estimation accuracy, and have low time complexity O(1) to update the estimations for a new user-item pair. In addition, our algorithms are simple and easy to use, without requirements to tune any parameter. Furthermore, we extend our methods to detect super spreaders with large cardinalities in real-time. We evaluate the performance of our methods on real-world datasets. The experimental results demonstrate that our methods are several times more accurate and faster than state-of-the-art methods using the same amount of memory.

30 November 2023 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
Jie MaJie Ma
Jie Ma
Jun LiuJun Liu
Jun Liu
QCQi Chai
Qi Chai
PWPinghui Wang
Pinghui Wang
JTJing Tao
Jing Tao

16 August 2012 in Computer Networks
Verified
Journal Article
Closed access
PWPinghui Wang
Pinghui Wang
XGXiaohong Guan
Xiaohong Guan
DTDon Towsley
Don Towsley
JTJing Tao
Jing Tao

13 May 2024
Verified
Conference Paper
Open access
HPHongbin Pei
Hongbin Pei
YXYuheng Xiong
Yuheng Xiong
PWPinghui Wang
Pinghui Wang
JTJing Tao
Jing Tao
JLJialun Liu
Jialun Liu
XGXiaohong Guan
Xiaohong Guan
In the realm of semi-supervised graph learning, pseudo-labeling is a pivotal strategy to utilize both labeled and unlabeled nodes for model training. Currently, confidence score is the most frequently used pseudo-labeling measure, however, it suffers from poor calibration and issues in out-of-distribution data. In this paper, we propose memory disagreement (MoDis for short), a novel uncertainty measure for pseudo-labeling. We uncover that training dynamics offer significant insights into prediction uncertainty --- if a graph model makes consistent predictions for an unlabeled node throughout training, the corresponding predicted label is likely to be correct. Thus, the node should be suitable for pseudo-labeling. The basic idea is supported by recent studies on training dynamics. We implement MoDis as the entropy of an accumulated distribution that summarizes the disagreement of the model's predictions throughout training. We further enhance and analyze MoDis in case studies, which show nodes with low MoDis are suitable for pseudo-labeling as these nodes tend to be distant from boundaries in both graph and representation space. We design MoDis based pseudo-label selection algorithm and corresponding pseudo-labeling algorithm, which are applicable to various graph neural networks. We empirically validate MoDis on eight benchmark graph datasets. The experimental results show that pseudo labels given by MoDis have better quality in correctness and information gain, and the algorithm benefits various graph neural networks, achieving an average relative improvement of 3.11% and reaching up to 30.24% when compared to the wildly-used uncertainty measure, confidence score. Moreover, we demonstrate the efficacy of MoDis on out-of-distribution nodes.

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.