Yangyang Li

Dr. Yangyang Li

National Engineering Research Center for Risk Perception and Prevention, China Academy of Electronics and Information Technology, Beijing 100041, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
27 December 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
QGqinglang guo
qinglang guo
HXHaiyong Xie
Haiyong Xie
Yangyang LiYangyang Li
Yangyang Li
WMWen Ma
Wen Ma
CZChao Zhang
Chao Zhang
The online social media ecosystem is becoming more and more confused because of more and more fake information and the social media of malicious users’ fake content; at the same time, unspeakable pain has been brought to mankind. Social robot detection uses supervised classification based on artificial feature extraction. However, user privacy is also involved in using these methods, and the hidden feature information is also ignored, such as semi-supervised algorithms with low utilization rates and graph features. In this work, we symmetrically combine BERT and GCN (Graph Convolutional Network, GCN) and propose a novel model that combines large scale pretraining and transductive learning for social robot detection, BGSRD. BGSRD constructs a heterogeneous graph over the dataset and represents Twitter as nodes using BERT representations. Corpus learning via text graph convolution network is a single text graph, which is mainly built for corpus-based on word co-occurrence and document word relationship. BERT and GCN modules can be jointly trained in BGSRD to achieve the best of merit, training data and unlabeled test data can spread label influence through graph convolution and can be carried out in the large-scale pre-training of massive raw data and the transduction learning of joint learning representation. The experiment shows that a better performance can also be achieved by BGSRD on a wide range of social robot detection datasets.

22 May 2023 in ACM Transactions on the Web
Verified
Journal Article
Open access
YYYingguang Yang
Yingguang Yang
Renyu YangRenyu Yang
Renyu Yang
Yangyang LiYangyang Li
Yangyang Li
KCKai Cui
Kai Cui
ZYZhiqin Yang
Zhiqin Yang
HXHaiyong Xie
Haiyong Xie
Social bots are referred to as the automated accounts on social networks that make attempts to behave like humans. While Graph Neural Networks (GNNs) have been massively applied to the field of social bot detection, a huge amount of domain expertise and prior knowledge is heavily engaged in the state-of-the-art approaches to design a dedicated neural network architecture for a specific classification task. Involving oversized nodes and network layers in the model design, however, usually causes the over-smoothing problem and the lack of embedding discrimination. In this article, we propose RoSGAS , a novel R einf o rced and S elf-supervised G NN A rchitecture S earch framework to adaptively pinpoint the most suitable multi-hop neighborhood and the number of layers in the GNN architecture. More specifically, we consider the social bot detection problem as a user-centric subgraph embedding and classification task. We exploit the heterogeneous information network to present the user connectivity by leveraging account metadata, relationships, behavioral features, and content features. RoSGAS uses a multi-agent deep reinforcement learning (RL), 31 pages. mechanism for navigating the search of optimal neighborhood and network layers to learn individually the subgraph embedding for each target user. A nearest neighbor mechanism is developed for accelerating the RL training process, and RoSGAS can learn more discriminative subgraph embedding with the aid of self-supervised learning. Experiments on five Twitter datasets show that RoSGAS outperforms the state-of-the-art approaches in terms of accuracy, training efficiency, and stability and has better generalization when handling unseen samples.

3 July 2022 in Neural Networks
Verified
Journal Article
Closed access
XZXusheng Zhao
Xusheng Zhao
Jia WUJia WU
Jia WU
HPHao Peng
Hao Peng
ABAmin Beheshti
Amin Beheshti
JMJessica J.M. Monaghan
Jessica J.M. Monaghan
LHLifang He
Lifang He

16 June 2023 in ACM Transactions on Asian and Low-Resource Language Information Processing
Verified
Journal Article
Open access
Hu HuangHu Huang
Hu Huang
BZBowen Zhang
Bowen Zhang
Yangyang LiYangyang Li
Yangyang Li
BZBaoquan Zhang
Baoquan Zhang
YSYuxi Sun
Yuxi Sun
CPCheng Peng
Cheng Peng
Investigating public attitudes on social media is important in opinion mining systems. Stance detection aims to analyze the attitude of an opinionated text (e.g., favor, neutral, or against) toward a given target. Existing methods mainly address this problem from the perspective of fine-tuning. Recently, prompt-tuning has achieved success in natural language processing tasks. However, conducting prompt-tuning methods for stance detection in real-world remains a challenge for several reasons: (1) The text form of stance detection is usually short and informal, which makes it difficult to design label words for the verbalizer. (2) The tweet text may not explicitly give the attitude. Instead, users may use various hashtags or background knowledge to express stance-aware perspectives. In this article, we first propose a prompt-tuning-based framework that performs stance detection in a cloze question manner. Specifically, a knowledge-enhanced prompt-tuning framework (KEprompt) method is designed, which consists of an automatic verbalizer (AutoV) and background knowledge injection (BKI). Specifically, in AutoV, we introduce a semantic graph to build a better mapping from the predicted word of the pretrained language model and detection labels. In BKI, we first propose a topic model for learning hashtag representation and introduce ConceptGraph as the supplement of the target. At last, we present a challenging dataset for stance detection, where all stance categories are expressed in an implicit manner. Extensive experiments on a large real-world dataset demonstrate the superiority of KEprompt over state-of-the-art methods.

16 March 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHongjia Wu
Hongjia Wu
JZJiao Zhang
Jiao Zhang
ZCZHIPING CAI
ZHIPING CAI
FLFang Liu
Fang Liu
Yangyang LiYangyang Li
Yangyang Li
Anfeng LiuAnfeng Liu
Anfeng Liu
With the widespread application of infotainment services in intelligent connected vehicles (ICV), network traffic has grown exponentially, bringing huge burden and energy consumption to ICV network. Edge caching, which enables edges (e.g., vehicles or roadside units) with cache storages, is a promising technology to alleviate this problem. In this paper, in terms of the hybrid communication mode of vehicle to vehicle (V2V) and vehicle to roadside unit (V2R), an energy aware caching scheme for infotainment services is proposed. Considering the geographical distribution of vehicles and roadside units as well as the size of transmission content, the energy consumption model in ICV network is formulated to implement the optimal selection of cache nodes. Then the selection of cache node in ICV network is transformed into the optimal stopping problem and solved by the optimal stopping theory. Finally, we propose a new algorithm for optimal energy efficiency cache node selection (OEECS). Simulation results show that the proposed OEECS can obtain higher energy saving and lower average access latency than other baseline schemes.

23 December 2019 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
BHBinbin Huang
Binbin Huang
Yangyang LiYangyang Li
Yangyang Li
LJLi Zhong Jin
Li Zhong Jin
LPLinxuan Pan
Linxuan Pan
SWShangguang Wang
Shangguang Wang
HHHaiyang Hu
Haiyang Hu
With the explosive growth of mobile applications, mobile devices need to be equipped with abundant resources to process massive and complex mobile applications. However, mobile devices are usually resource-constrained due to their physical size. Fortunately, mobile edge computing, which enables mobile devices to offload computation tasks to edge servers with abundant computing resources, can significantly meet the ever-increasing computation demands from mobile applications. Nevertheless, offloading tasks to the edge servers are liable to suffer from external security threats (e.g., snooping and alteration). Aiming at this problem, we propose a security and cost-aware computation offloading (SCACO) strategy for mobile users in mobile edge computing environment, the goal of which is to minimize the overall cost (including mobile device’s energy consumption, processing delay, and task loss probability) under the risk probability constraints. Specifically, we first formulate the computation offloading problem as a Markov decision process (MDP). Then, based on the popular deep reinforcement learning approach, deep Q-network (DQN), the optimal offloading policy for the proposed problem is derived. Finally, extensive experimental results demonstrate that SCACO can achieve the security and cost efficiency for the mobile user in the mobile edge computing environment.