Chaowei Zhang

Dr. Chaowei Zhang

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 February 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
CZChaowei Zhang
Chaowei Zhang
AGAshish Gupta
Ashish Gupta
Xiao QinXiao Qin
Xiao Qin
YZYi Zhou
Yi Zhou

12 July 2023 in Transactions of the Association for Computational Linguistics
Verified
Journal Article
Open access
PDF file
JQJipeng Qiang
Jipeng Qiang
YLYang Li
Yang Li
CZChaowei Zhang
Chaowei Zhang
YLYun Li
Yun Li
YZYi Zhu
Yi Zhu
XWXindong Wu
Xindong Wu
Idioms are a kind of idiomatic expression in Chinese, most of which consist of four Chinese characters. Due to the properties of non-compositionality and metaphorical meaning, Chinese idioms are hard to be understood by children and non-native speakers. This study proposes a novel task, denoted as Chinese Idiom Paraphrasing (CIP). CIP aims to rephrase idiom-containing sentences to non-idiomatic ones under the premise of preserving the original sentence’s meaning. Since the sentences without idioms are more easily handled by Chinese NLP systems, CIP can be used to pre-process Chinese datasets, thereby facilitating and improving the performance of Chinese NLP tasks, e.g., machine translation systems, Chinese idiom cloze, and Chinese idiom embeddings. In this study, we can treat the CIP task as a special paraphrase generation task. To circumvent difficulties in acquiring annotations, we first establish a large-scale CIP dataset based on human and machine collaboration, which consists of 115,529 sentence pairs. In addition to three sequence-to-sequence methods as the baselines, we further propose a novel infill-based approach based on text infilling. The results show that the proposed method has better performance than the baselines based on the established CIP dataset.

30 December 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
XNXueying Niu
Xueying Niu
CZChaowei Zhang
Chaowei Zhang
XZXiaojie Zhao
Xiaojie Zhao
LHLihua Hu
Lihua Hu
JZJifu Zhang
Jifu Zhang

11 September 2024 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
HSHui Sun
Hui Sun
BLBendong Lou
Bendong Lou
CZChao Zhao
Chao Zhao
DKDeyan Kong
Deyan Kong
CZChaowei Zhang
Chaowei Zhang
Xiao QinXiao Qin
Xiao Qin
LSM-tree-based key-value stores (KV stores) convert random-write requests to sequence-write ones to achieve high I/O performance. Meanwhile, compaction operations in KV stores update SSTables in forms of reorganizing low-level data components to high-level ones, thereby guaranteeing an orderly data layout in each component. Repeated writes caused by compaction (a.k.a. write amplification) impacts I/O bandwidth and overall system performance. Near-data processing (NDP) is one of the effective approaches to addressing this write-amplification issue. Most NDP-based techniques adopt synchronous parallel schemes to perform a compaction task on both the host and its NDP-enabled device. In synchronous parallel compaction schemes, the execution time of compaction is determined by a subsystem that has lower compaction performance coupled by under-utilized computing resources in a NDP framework. To solve this problem, we propose an asynchronous parallel scheme named PStore to improve the compaction performance in KV stores. In PStore, we designed a multi-tasks queue and three priority-based scheduling methods. PStore elects proper compaction tasks to be offloaded in host- and device-side compaction modules. Our proposed cross-leveled compaction mechanism mitigates write amplification induced by asynchronous compaction. PStore featured with the asynchronous compaction mechanism fully utilizes computing resources in both host- and device-side subsystems. Compared with the two popular synchronous compaction modes based on KV stores (TStore and LevelDB), our PStore immensely improves the throughput by up to a factor of 14 and 10.52 with an average of a factor of 2.09 and 1.73, respectively.

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
CZChaowei Zhang
Chaowei Zhang
ZFZongling Feng
Zongling Feng
ZZZewei Zhang
Zewei Zhang
JQJipeng Qiang
Jipeng Qiang
GXGuandong Xu
Guandong Xu
YLYun Li
Yun Li
The questionable responses caused by knowledge hallucination may lead to LLMs' unstable ability in decision-making. However, it has never been investigated whether the LLMs' hallucination is possibly usable for generating negative reasoning to assist fake news detection. In this paper, we propose a novel supervised self-reinforced reasoning rectification approach - SR^3 that not only yields common reasonable reasoning for news but also forces LLMs to generate the wrong understandings of news via LLMs reflection for semantic consistency learning. Upon that, we construct a negative reasoning-based news learning model called - NRFE, which leverages positive or negative news-reasoning pairs for learning the semantic consistency between them. To avoid the impact of label-implicated reasoning, we deploy a student model - NRFE-D that only takes news content as input to inspect the performance of our method by distilling the knowledge from NRFE. The experimental results verified on three popular fake news datasets demonstrate the superiority of our method compared with three kinds of baselines including prompting-based LLMs, fine-tuning-based PLMs, and other representative fake news detection methods.

1 July 2019 in Expert Systems with Applications
Verified
Journal Article
Closed access
NPNing Pang
Ning Pang
JZJifu Zhang
Jifu Zhang
CZChaowei Zhang
Chaowei Zhang
Xiao QinXiao Qin
Xiao Qin
JCJianghui Cai
Jianghui Cai