Qiong Dai

Qiong Dai

Auto-generated profile, based on publicly available information

Qiong Dai

Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China and School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
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

11 February 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XZXusheng Zhao
Xusheng Zhao
QDQiong Dai
Qiong Dai
Jia WUJia WU
Jia WU
HPHao Peng
Hao Peng
MLMingsheng Liu
Mingsheng Liu
PYPhilip S. Yu
Philip S. Yu
Graph Neural Networks (GNNs) have yielded fruitful results in learning multi-view graph data. However, it is challenging for existing GNNs to capture the potential correlation information (PCI) among the graph structure features of multiple views. It is also challenging to adaptively identify valuable neighbors for node feature fusion in different views. To this end, we propose a novel R einforced T ensor G raph N eural N etwork (RTGNN) framework to more effectively perform multi-view graph representation learning through reinforcing inter- and intra-graph aggregation. Specifically, RTGNN first uses tensor decomposition to extract the graph structure features (GSFs) of each view in the common feature space. These GSFs contain the PCI of multiple views and alleviate fusion conflicts that may be caused by differences between view feature spaces in cross-view feature fusion. Since fusing the features of all neighbor nodes may harm the features of the center node, we filter the irrelevant neighbors to improve the performance of intra-graph aggregation in each view. Concretely, a reinforcement learning (RL)-guided scheme is developed to automatically calculate the optimal filtering threshold for each view, avoiding tedious manual updates and infeasible back propagation updates. Experimental results and analysis on five datasets show that RTGNN surpasses the best multi-view graph representation baselines and achieves the maximum 14.26% performance improvement in terms of F1. The code link is https://github.com/RingBDStack/RTGNN .

4 March 2024
Verified
Conference Paper
Open access
XZXusheng Zhao
Xusheng Zhao
HPHao Peng
Hao Peng
QDQiong Dai
Qiong Dai
XBXu Bai
Xu Bai
HPHuailiang Peng
Huailiang Peng
PYPhilip S. Yu
Philip S. Yu
Aspect-based sentiment analysis (ABSA) is dedicated to forecasting the sentiment polarity of aspect terms within sentences. Employing graph neural networks to capture structural patterns from syntactic dependency parsing has been confirmed as an effective approach for boosting ABSA. In most works, the topology of dependency trees or dependency-based attention coefficients is often loosely regarded as edges between aspects and opinions, which can result in insufficient and ambiguous syntactic utilization. To address these problems, we propose a new reinforced dependency graph convolutional network (RDGCN) that improves the importance calculation of dependencies in both distance and type views. Initially, we propose an importance calculation criterion for the minimum distances over dependency trees. Under the criterion, we design a distance-importance function that leverages reinforcement learning for weight distribution search and dissimilarity control. Since dependency types often do not have explicit syntax like tree distances, we use global attention and mask mechanisms to design type-importance functions. Finally, we merge these weights and implement feature aggregation and classification. Comprehensive experiments show the effectiveness of the criterion and importance functions. RDGCN yields excellent analysis results.

30 September 2019
Verified
Book Chapter
Closed access
PDF file
TCTian Cai
Tian Cai
MSMengjun Shen
Mengjun Shen
HPHuailiang Peng
Huailiang Peng
LJLei Jiang
Lei Jiang
QDQiong Dai
Qiong Dai

30 April 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XZXusheng Zhao
Xusheng Zhao
QDQiong Dai
Qiong Dai
XBXu Bai
Xu Bai
Jia WUJia WU
Jia WU
HPHao Peng
Hao Peng
PYPhilip S. Yu
Philip S. Yu
Multiple instance learning (MIL) trains models from bags of instances, where each bag contains multiple instances, and only bag-level labels are available for supervision. The application of graph neural networks (GNNs) in capturing intrabag topology effectively improves MIL. Existing GNNs usually require filtering low-confidence edges among instances and adapting graph neural architectures to new bag structures. However, such asynchronous adjustments to structure and architecture are tedious and ignore their correlations. To tackle these issues, we propose a reinforced GNN framework for MIL (RGMIL), pioneering the exploitation of multiagent deep reinforcement learning (MADRL) in MIL tasks. MADRL enables the flexible definition or extension of factors that influence bag graphs or GNNs and provides synchronous control over them. Moreover, MADRL explores structure-to-architecture correlations while automating adjustments. Experimental results on multiple MIL datasets demonstrate that RGMIL achieves the best performance with excellent explainability. The code and data are available at https://github.com/RingBDStack/RGMIL.

14 October 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CTChaodong Tong
Chaodong Tong
HPHuailiang Peng
Huailiang Peng
XBXu Bai
Xu Bai
QDQiong Dai
Qiong Dai
RZRuitong Zhang
Ruitong Zhang
XGXian-Ming Gu
Xian-Ming Gu
Event detection on social platforms can help people perceive essential events and make actionable decisions. Existing document-pivot streaming social event detection methods generally embed documents and perform text clustering. They face the challenges of constantly changing context and unknown event categories and struggle by designing compound text representation methods and various similarity measures. However, phased, well-designed methods are excessively fragile and unable to utilize the potential of text representations fully. Meanwhile, their complex threshold settings result in clustering-based event detection suffering the pain of ever-changing environments. We propose a text representation learning method namely Text Sim ilarity C ontrastive L earning N eural N etwork (Text-SimCLNN) to tackle these challenges. Text-SimCLNN uses smaller parts to learn the similarity probability of text pairs from semantic and structural perspectives, effectively bridging the gap between text representation learning and similarity measure in streaming event detection. Event discovery and merging in streams can be easily performed based on the learned representations, and we use various techniques to speed up such processes. Furthermore, we introduce an online update mechanism that uses heterogeneous graphs to generate high-quality samples to enable stable and reliable inductive learning. Extensive experiments on two real-world datasets demonstrate that our method far exceeds state-of-the-art (SOTA).