Qi Ouyang

Qi Ouyang

Auto-generated profile, based on publicly available information

Qi Ouyang

Information Engineering University

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
27 January 2026 in Information Processing & Management
Verified
Journal Article
Closed access
QOQi Ouyang
Qi Ouyang
HCHongchang Chen
Hongchang Chen
SLShu-Xin Liu
Shu-Xin Liu
RLRan Li
Ran Li
KWKai Wang
Kai Wang
YLYingle Li
Yingle Li

14 December 2023
Verified
Conference Paper
Open access
JZJunjie Zhang
Junjie Zhang
SLShu-Xin Liu
Shu-Xin Liu
CLCaixia Liu
Caixia Liu
WZWeifei Zang
Weifei Zang
SZShibo Zhang
Shibo Zhang
QOQi Ouyang
Qi Ouyang
In real life, interdependent networks are common and their robustness has received considerable attention. When an interdependent network is attacked, the failure may propagate along the links to the whole network. Among them, adding inter-links is an effective way to improve the robustness of the network, but it becomes a challenge to achieve maximum improvement in robustness with a limited number of added links, and in real network scenarios, we may have limited information about the network. To address this problem, in this paper, we propose a multi-population quantum genetic algorithm for optimizing the link addition strategy to improve the robustness of interdependent networks against random attacks, called MPQGA. In addition, we design an effective quantum revolving gate strategy and a multi-population migration operator to find the optimal way to add links globally. In the experiments, we compare the proposed algorithm with four existing methods on two types of interdependent networks of different sizes, and the experimental results show that MPQGA performs excellently in enhancing the robustness of interdependent networks.

14 July 2026
Verified
Book Chapter
Closed access
PDF file
QOQi Ouyang
Qi Ouyang
SLShu-Xin Liu
Shu-Xin Liu
RLRan Li
Ran Li
JZJunjie Zhang
Junjie Zhang
HCHongchang Chen
Hongchang Chen
YMYuke Ma
Yuke Ma

14 December 2023
Verified
Conference Paper
Open access
RLRan Li
Ran Li
SLShu-Xin Liu
Shu-Xin Liu
HCHongchang Chen
Hongchang Chen
KWKai Wang
Kai Wang
JZJunjie Zhang
Junjie Zhang
QOQi Ouyang
Qi Ouyang
Outlier detection is a fundamental task in data mining and knowledge discovery. For graph-based unsupervised outlier detection, it is typical to discover normal object behavior by utilizing the similarity neighborhood relationship among objects to identify outliers. However, the core challenge in outlier detection lies in identifying anomalies, errors, or rare instances that deviate from ordinary patterns. Directly leveraging object dissimilarity for outlier detection may be more straightforward and efficient. Accordingly, we propose a novel and efficient DRS (Distant Relative Stranger) model based on dissimilarity to discover outliers. Specifically, this study constructs a distant neighbor information network for incomplete mixed data based on object dissimilarity and uncertainty. By utilizing the local information of probabilistic graph models, the model characterizes the degree of anomaly for each object, achieving strong adaptability and high-performance unsupervised outlier detection. Through performance evaluation on 16 real-world datasets and comparison with 12 other models, it is evident that the proposed DRS model demonstrates the advantages of simplicity and stable performance in unsupervised outlier detection tasks. This research provides a new avenue and applicable approach for graph-based outlier detection studies.

12 July 2026
Verified
Book Chapter
Closed access
BLBaolin Li
Baolin Li
HTHu Tao
Hu Tao
XLXinlei Liu
Xinlei Liu
BZBeilei Zhang
Beilei Zhang
QOQi Ouyang
Qi Ouyang
HMHailong Ma
Hailong Ma