Dawei Zhou

Dawei Zhou

Auto-generated profile, based on publicly available information

Dawei Zhou

Virginia Tech, Blacksburg, VA, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
25 July 2024 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
YWYuxing Wang
Yuxing Wang
JZJunhan Zhao
Junhan Zhao
HXHongye Xu
Hongye Xu
CHCheng Han
Cheng Han
ZTZhiqiang Tao
Zhiqiang Tao
ZJZhicheng ji
Zhicheng ji
Cell segmentation is a fundamental task in analyzing biomedical images. Many computational methods have been developed for cell segmentation and instance segmentation, but their performances are not well understood in various scenarios. We systematically evaluated the performance of 18 segmentation methods to perform cell nuclei and whole cell segmentation using light microscopy and fluorescence staining images. We found that general-purpose methods incorporating the attention mechanism exhibit the best overall performance. We identified various factors influencing segmentation performances, including image channels, choice of training data, and cell morphology, and evaluated the generalizability of methods across image modalities. We also provide guidelines for choosing the optimal segmentation methods in various real application scenarios. We developed Seggal, an online resource for downloading segmentation models already pre-trained with various tissue and cell types, substantially reducing the time and effort for training cell segmentation models.

21 October 2024 in CIKM: Conference on Information and Knowledge Management
Verified
Conference Paper
Open access
BJBaoyu Jing
Baoyu Jing
DZDawei Zhou
Dawei Zhou
KRKan Ren
Kan Ren
CYCarl Yang
Carl Yang
Spatiotemporal time series are usually collected via monitoring sensors placed at different locations, which usually contain missing values due to various failures, such as mechanical damages and Internet outages. Imputing the missing values is crucial for analyzing time series. When recovering a specific data point, most existing methods consider all the information relevant to that point regardless of the cause-and-effect relationship. During data collection, it is inevitable that some unknown confounders are included, e.g., background noise in time series and non-causal shortcut edges in the constructed sensor network. These confounders could open backdoor paths and establish non-causal correlations between the input and output. Over-exploiting these non-causal correlations could cause overfitting. In this paper, we first revisit spatiotemporal time series imputation from a causal perspective and show how to block the confounders via the frontdoor adjustment. Based on the results of frontdoor adjustment, we introduce a novel Causality-Aware Spatiotemporal Graph Neural Network (Casper), which contains a novel Prompt Based Decoder (PBD) and a Spatiotemporal Causal Attention (SCA). PBD could reduce the impact of confounders and SCA could discover the sparse causal relationships among embeddings. Theoretical analysis reveals that SCA discovers causal relationships based on the values of gradients. We evaluate Casper on three real-world datasets, and the experimental results show that Casper could outperform the baselines and could effectively discover the causal relationships.

8 May 2025
Verified
Conference Paper
Open access
LHLifu Huang
Lifu Huang
DKDanai Koutra
Danai Koutra
AKAdithya Kulkarni
Adithya Kulkarni
TPTemiloluwa Prioleau
Temiloluwa Prioleau
QWQingyun Wu
Qingyun Wu
DZDawei Zhou
Dawei Zhou


4 August 2023
Verified
Conference Paper
Open access
LWLongfeng Wu
Longfeng Wu
BLBowen Lei
Bowen Lei
DXDongkuan Xu
Dongkuan Xu
DZDawei Zhou
Dawei Zhou

24 August 2024
Verified
Conference Paper
Open access
HWHaohui Wang
Haohui Wang
BJBaoyu Jing
Baoyu Jing
KDKaize Ding
Kaize Ding
YZYada Zhu
Yada Zhu
WCWei Cheng
Wei Cheng
DZDawei Zhou
Dawei Zhou
In the context of long-tail classification on graphs, the vast majority of existing work primarily revolves around the development of model debiasing strategies, intending to mitigate class imbalances and enhance the overall performance. Despite the notable success, there is very limited literature that provides a theoretical tool for characterizing the behaviors of long-tail classes in graphs and gaining insight into generalization performance in real-world scenarios. To bridge this gap, we propose a generalization bound for long-tail classification on graphs by formulating the problem in the fashion of multi-task learning, i.e., each task corresponds to the prediction of one particular class. Our theoretical results show that the generalization performance of long-tail classification is dominated by the overall loss range and the task complexity. Building upon the theoretical findings, we propose a novel generic framework HierTail for long-tail classification on graphs. In particular, we start with a hierarchical task grouping module that allows us to assign related tasks into hypertasks and thus control the complexity of the task space; then, we further design a balanced contrastive learning module to adaptively balance the gradients of both head and tail classes to control the loss range across all tasks in a unified fashion. Extensive experiments demonstrate the effectiveness of HierTail in characterizing long-tail classes on real graphs, which achieves up to 12.9% improvement over the leading baseline method in balanced accuracy.