Shiwen Ni

Prof. Shiwen Ni

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
26 July 2021 in IEEE Access
Verified
Journal Article
Open access
SNShiwen Ni
Shiwen Ni
JLJiawen Li
Jiawen Li
HKHung-Yu Kao
Hung-Yu Kao
Fake news on social media is a widespread and serious problem in today's society. Existing fake news detection methods focus on finding clues from Long text content, such as original news articles and user comments. This paper solves the problem of fake news detection in more realistic scenarios. Only source shot-text tweet and its retweet users are provided without user comments. We develop a novel neural network based model, Multi-View Attention Networks (MVAN) to detect fake news and provide explanations on social media. The MVAN model includes text semantic attention and propagation structure attention, which ensures that our model can capture information and clues both of source tweet content and propagation structure. In addition, the two attention mechanisms in the model can find key clue words in fake news texts and suspicious users in the propagation structure. We conduct experiments on two real-world datasets, and the results demonstrate that MVAN can significantly outperform state-of-the-art methods by 2.5% in accuracy on average, and produce a reasonable explanation.


19 May 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
SNShiwen Ni
Shiwen Ni
HKHung-Yu Kao
Hung-Yu Kao

24 November 2020 in IEEE Access
Verified
Journal Article
Open access
JLJiawen Li
Jiawen Li
SNShiwen Ni
Shiwen Ni
HKHung-Yu Kao
Hung-Yu Kao
Rumors in social media represent a severe problem prevailing in today’s society. Previous studies on automated rumor detection have shown that the topological information specific to social media is a vital clue for debunking rumors. However, existing automatic rumor detection approaches either oversimplify the graph structure or ignore this crucial clue. To address this issue, we propose a model that explores homogeneity and conversation structure to identify rumors. Our model learns more comprehensive and precise representations by modeling follower-following relationships of users, simulating the propagation layout of tweets, and connecting responders’ behavior. The experimental results on two public Twitter datasets show that our model’s performance outperforms other state-of-the-art baseline models. Furthermore, the experimental results prove our hypothesis that birds of a feather rumor together. The results demonstrate that both the conversation structure and the friend network’s homogeneity are significant for checking the veracity of a suspicious tweet.

1 January 2025
Verified
Conference Paper
Open access
PDF file
CZChenhao Zhang
Chenhao Zhang
XFXi Feng
Xi Feng
YBYuelin Bai
Yuelin Bai
XDXeron Du
Xeron Du
JHJinchang Hou
Jinchang Hou
SNShiwen Ni
Shiwen Ni
Chenhao Zhang, Xi Feng, Yuelin Bai, Xeron Du, Jinchang Hou, Kaixin Deng, Guangzeng Han, Qinrui Li, Bingli Wang, Jiaheng Liu, Xingwei Qu, Yifei Zhang, Qixuan Zhao, Yiming Liang, Ziqiang Liu, Feiteng Fang, Min Yang, Wenhao Huang, Chenghua Lin, Ge Zhang, Shiwen Ni. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.

11 May 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
SNShiwen Ni
Shiwen Ni
HKHung-Yu Kao
Hung-Yu Kao
Recently, prompt-based learning has shown excellent performance on few-shot scenarios. Using frozen language models to tune trainable continuous prompt embeddings has become a popular and powerful methodology. For few-shot natural language understanding, even if we freeze the parameters of the pre-trained language model, the learned pseudo-prompts might still be overfitted. In this paper, we propose a novel masked siamese prompt tuning (MSP-tuning) to improve few-shot natural language understanding. Concretely, MSP-tuning masks randomly out part of the prompt tokens to get a pair of masked siamese prompts for each sample. Each training sample is then fed to the model twice with the masked siamese prompts. Finally, MSP-tuning minimizes the JS-divergence between the two output probability distributions of the pre-trained language model to regularize the model further. Experiment results on the few-shot GLUE benchmark and SuperGLUE benchmark show that MSP-tuning outperforms previous approaches. Numerically, our MSP-tuning achieves an average improvement of 1.79% (BERT-base) and 1.39% (BERT-large) of the GLUE benchmark and 1.90% (RoBERTa-base) and 1.71% (RoBERTa-large) of the SuperGLUE benchmark compared to state-of-the-art method P-tuning. Our method facilitates applying large pre-trained language models in natural language understanding.