Yuan Li

Yuan Li


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
15 July 2021 in World Wide Web
Verified
Journal Article
Closed access
PDF file
YLYuan Li
Yuan Li
JLJinsheng Liu
Jinsheng Liu
HZHuiqun Zhao
Huiqun Zhao
JSJing Sun
Jing Sun
YZYuhai Zhao
Yuhai Zhao
GWGuoren Wang
Guoren Wang

7 November 2019 in World Wide Web
Verified
Journal Article
Closed access
PDF file
YLYuan Li
Yuan Li
GWGuoren Wang
Guoren Wang
YZYuhai Zhao
Yuhai Zhao
FZFeida Zhu
Feida Zhu
YWYubao Wu
Yubao Wu

1 June 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
LLLing Li
Ling Li
YZYuhai Zhao
Yuhai Zhao
YLYuan Li
Yuan Li
FWFazal Wahab
Fazal Wahab
ZWZhengkui Wang
Zhengkui Wang

12 May 2021 in IEEE Access
Verified
Journal Article
Open access
XFXiaolin Fan
Xiaolin Fan
YLYuan Li
Yuan Li
JSJing Sun
Jing Sun
YZYuhai Zhao
Yuhai Zhao
GWGuoren Wang
Guoren Wang
Social Internet of Things (SIoT) is extended to integrate social networks in the Internet of Things (IoT). SIoT enriches IoT, and thus resource (or service) discovery and consolidation in SIoT becomes an important and challenging problem. In this paper, we represent the SIoT as the heterogeneous information networks (HINs) with multi-typed entities and relations, and resolve this problem from the perspective of cohesive subgraph search. Specifically, given a query node $q$ , we discover a cohesive subgraph containing $q$ from a HIN, where all nodes are of the same type as $q$ and have dense relationships. Yet existing solutions cannot be applied to various HINs, and the result subgraph is not accurate and close enough due to ignoring the connectivity among nodes within the subgraph. To this end, 1) we extend the connectivity with novel meta-path-based edge-disjoint paths to HINs, and propose the $k$ -path connected component ( $k$ -PCC) to measure the cohesiveness of subgraph in HINs; 2) we model the densest connected subgraph containing $q$ as the $k$ -PCC with the maximum connectivity including $q$ , called the Steiner Maximum Path-Connected Subgraph (SMPCS); 3) we develop efficient algorithms based on an index tree for searching the SMPCS. Extensive experiments on four real HINs are conducted to demonstrate the effectiveness and efficiency of our proposed approaches.

12 September 2017 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YLYuan Li
Yuan Li
YZYuhai Zhao
Yuhai Zhao
GWGuoren Wang
Guoren Wang
ZWZhanghui Wang
Zhanghui Wang
MGMin Gao
Min Gao
Genetic association study (GAS) is a promising tool for detecting and analyzing the cause of complex diseases. The extreme learning machine (ELM) has been successfully applied in a variety of research fields. Yet, as a black box method, it could not measure up to the task of GAS by itself, because it cannot tell us what causes the diseases, which is very crucial to the biologists. In this paper, we propose an ELM-based statistically significant pattern classification framework, which combines ELM with feature vector-based methods to solve the GAS problem efficiently and effectively. In particular: 1) a statistically significant pattern considering in terms of both family wise error rate (FWER) and false discovery rate (FDR) is proposed to control false positives in multiple hypothesis tests, which is necessary in GAS, but ignored by most of the existing methods; 2) an upper bound of the significance of a pattern is deduced to speed up FWER-constrained statistically significant pattern mining in a row enumeration way. Further, a space-effective grid index is devised to dramatically improves the efficiency of FDR-constrained pattern discovery; and 3) an ELM classifier is constructed based on the significant patterns. Comprehensive empirical studies on four real genotype datasets demonstrate much higher efficiency and effectiveness of our proposed framework with respect to the compared methods.

6 August 2019 in Entropy
Verified
Journal Article
Open access
PDF file
BGBoxin Guan
Boxin Guan
YZYuhai Zhao
Yuhai Zhao
YLYuan Li
Yuan Li
Solving the constraint satisfaction problem (CSP) is to find an assignment of values to variables that satisfies a set of constraints. Ant colony optimization (ACO) is an efficient algorithm for solving CSPs. However, the existing ACO-based algorithms suffer from the constructed assignment with high cost. To improve the solution quality of ACO for solving CSPs, an ant colony optimization based on information entropy (ACOE) is proposed in this paper. The proposed algorithm can automatically call a crossover-based local search according to real-time information entropy. We first describe ACOE for solving CSPs and show how it constructs assignments. Then, we use a ranking-based strategy to update the pheromone, which weights the pheromone according to the rank of these ants. Furthermore, we introduce the crossover-based local search that uses a crossover operation to optimize the current best assignment. Finally, we compare ACOE with seven algorithms on binary CSPs. The experimental results revealed that our method outperformed the other compared algorithms in terms of the cost comparison, data distribution, convergence performance, and hypothesis test.