Qian Li

Qian Li

Auto-generated profile, based on publicly available information

Qian Li

Sociology, The University of Hong Kong

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
1 June 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
QLQian Li
Qian Li
SLSan-Yang Liu
San-Yang Liu
XYXin-She Yang
Xin-She Yang

8 March 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
RFRong Fei
Rong Fei
YWYuxin Wan
Yuxin Wan
BHBo Hu
Bo Hu
Aimin LiAimin Li
Aimin Li
QLQian Li
Qian Li

1 January 2020 in Expert Systems with Applications
Verified
Journal Article
Closed access
QLQian Li
Qian Li
SLSan-Yang Liu
San-Yang Liu
XYXin-She Yang
Xin-She Yang

13 April 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YBYiguang Bai
Yiguang Bai
SLSanyang Liu
Sanyang Liu
QLQian Li
Qian Li
JYJing Yuan
Jing Yuan
It is challenging to deploy check-in nodes optimally in a complex network so as to perform specific check-in like services, e.g., fuel supplements etc., but crucial in many real-world applications. In this article, we propose and study the new optimization problem of placing check-in nodes with the minimum cost, i.e., the problem of finding the minimum-cost check-in nodes (MCCN), which is of great interests for real-world application situations, but even more difficult. We motivate the new algorithms through three typical worse cases by the often-used greedy-type algorithms, i.e., One-to-Many, Many-to-One, and Duplicate-Overrides. With this respect, the proposed novel optimization algorithms utilize a novel metric of contribution density for selecting check-in nodes iteratively, which successfully avoid the occurrence of the two worse cases of One-to-Many and Many-to-One. We also introduce an extra backward extraction step in one of new algorithms, which overcomes the crucial worse case of “duplicate overrides” and largely improves the algorithmic performance in solving the introduced optimization problem of MCCN. Meanwhile, we extend the new contribution density metric to a more general class of functions and study their effectiveness to eliminate the two worse cases of One-to-Many and Many-to-One; also, a detailed analysis on complexity and performance of the proposed algorithms is presented to show their numerical efficiency and accuracy. Extensive experiments over two classical artificial networks, i.e., BA network and ER network, and ten real-world networks, under two typical cost setups, show the proposed algorithms significantly outperform the four state-of-the-art algorithms. We also demonstrate that our proposed algorithms are much reliable and robust with different experiment settings of deployment cost and network-type and scale.

1 March 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
QLQian Li
Qian Li
SLSanyang Liu
Sanyang Liu
YBYiguang Bai
Yiguang Bai
XHXingshi He
Xingshi He
XYXin-She Yang
Xin-She Yang

18 September 2021 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
YBYiguang Bai
Yiguang Bai
QLQian Li
Qian Li
YFYanni Fan
Yanni Fan
SLSanyang Liu
Sanyang Liu
Dense networks are very pervasive in social analytics, biometrics, communication, architecture, etc. Analyzing and visualizing such large-scale networks are significant challenges, which are generally met by reducing the redundancy on the level of nodes or edges. Motifs, patterns of the higher order organization compared with nodes and edges, are recently found to be the novel fundamental unit structures of complex networks. In this work, we proposed a novel motif h-backbone (Motif-h) method to extract functional cores of directed networks based on both motif strength and h-bridge. Compared with the state-of-the-art method Motif-DF and Entropy, our method solves two main issues which are often found in existing methods: the Motif-h reconsiders weak ties into our candidate set, and those weak ties often have critical functions of bridges in networks; moreover, our method provides a trade-off between the motif size and the edge strength, which quantifies the core edges accordingly. In the simulations, we compare our method with Motif-DF in four real-world networks and found that Motif-h can streamline the extraction of crucial structures compared with the others with limited edges.