Liangrui Ren

Mr. Liangrui Ren


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
2 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LRLiangrui Ren
Liangrui Ren
Guoxian YuGuoxian Yu
Guoxian Yu
JWJun Wang
Jun Wang
LLLei Liu
Lei Liu
CDCarlotta Domeniconi
Carlotta Domeniconi
XZXiangliang Zhang
Xiangliang Zhang
Multiple clusterings can explore the same set of data from different perspectives by discovering different and meaningful clusterings. However, most, if not all, of the existing approaches overwhelmingly focus on the diversity between clustering subspaces, and pay much less attention on the salience of the subspaces. As a consequence, the quality of the produced clusterings is an understudied aspect of the problem. Furthermore, existing methods cannot explain the unique internal subspace structure of each clustering, and cannot incorporate multi-facet knowledge to generate different clusterings. In this paper, we propose a solution named iMClusts ( i nterpretable M ultiple Clust ering s by diversified attention). iMClusts makes use of the expressive representational power of deep autoencoders and multi-head attention to generate multiple salient embedding matrices, and multiple clusterings therein. In addition, it leverages multi-facet knowledge and enhances the diversity between heads to boost the quality and diversity of multiple clusterings. Experimental results on benchmark datasets show that iMClusts can generate multiple clusterings with quality, interpretability, and diversity.

1 December 2020 in Computational Biology and Chemistry
Verified
Journal Article
Closed access
LRLiangrui Ren
Liangrui Ren
YGYing-Lian Gao
Ying-Lian Gao
JLJin-xing Liu
Jin-xing Liu
RZRong Zhu
Rong Zhu
XKXiang-Zhen Kong
Xiang-Zhen Kong

7 October 2020 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
LRLiangrui Ren
Liangrui Ren
YGYing-Lian Gao
Ying-Lian Gao
JLJin-xing Liu
Jin-xing Liu
Junliang ShangJunliang Shang
Junliang Shang
CZChunhou Zheng
Chunhou Zheng
Background: As a machine learning method with high performance and excellent generalization ability, extreme learning machine (ELM) is gaining popularity in various studies. Various ELM-based methods for different fields have been proposed. However, the robustness to noise and outliers is always the main problem affecting the performance of ELM. Results: In this paper, an integrated method named correntropy induced loss based sparse robust graph regularized extreme learning machine (CSRGELM) is proposed. The introduction of correntropy induced loss improves the robustness of ELM and weakens the negative effects of noise and outliers. By using the L2,1-norm to constrain the output weight matrix, we tend to obtain a sparse output weight matrix to construct a simpler single hidden layer feedforward neural network model. By introducing the graph regularization to preserve the local structural information of the data, the classification performance of the new method is further improved. Besides, we design an iterative optimization method based on the idea of half quadratic optimization to solve the non-convex problem of CSRGELM. Conclusions: The classification results on the benchmark dataset show that CSRGELM can obtain better classification results compared with other methods. More importantly, we also apply the new method to the classification problems of cancer samples and get a good classification effect.

1 September 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
LRLiangrui Ren
Liangrui Ren
JLJin-Xing Liu
Jin-Xing Liu
YGYing-Lian Gao
Ying-Lian Gao
XKXiang-Zhen Kong
Xiang-Zhen Kong
CZChun-Hou Zheng
Chun-Hou Zheng

12 December 2024 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
YZYongzheng Zhu
Yongzheng Zhu
LRLiangrui Ren
Liangrui Ren
RSRong Sun
Rong Sun
JWJun Wang
Jun Wang
Guoxian YuGuoxian Yu
Guoxian Yu
Herb-target interactions (HTIs) are pivotal for unveiling the underlying pharmacological mechanisms between herbs and biological targets (e.g., proteins and nucleic acids). Unlike typical drugs, each of which is made of one pharmacological compound, the herb is composed of different pharmacological ingredients, while contemporary computational approaches mainly focus on HTIs, neglecting the more refined and informative ingredient-target interactions (ITIs). Furthermore, those methods also disregard the complex associations between herbs and ingredients, which have multi-granular interactions with targets. We propose a multi-instance learning based solution (HTI-MIL) to identify HTIs and the finer ITIs. Particularly, HTI-MIL employs Autoencoder, Convolutional Neural Networks, and Graph Convolution Networks to learn representations of herbs, targets, and ingredients, respectively. Next, it takes herbs as bags and ingredients as instances to model the interplay between herbs and ingredients by multi-instance learning, and aggregates ingredient features toward their hosting herb. After that, it leverages the representation of ingredients and targets to predict ITIs, and fuses the representations of herbs, ingredients and targets to predict HTIs. Experimental results show that HTIMIL outperforms competitive methods by at least 5.2%, 4.8%, and 6.4% in AUROC, AUPRC, and F1-score, respectively. HTIMIL validates on typical herbs and confirms ≥90% of the top 20 candidate targets, and also finds out novel interactions. In addition, the targets identified by HTI-MIL help to dissect the mechanism of herb-induced liver injury, which further validates its effectiveness.

4 August 2021 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
LRLiangrui Ren
Liangrui Ren
YGYing-Lian Gao
Ying-Lian Gao
Junliang ShangJunliang Shang
Junliang Shang
JLJin-xing Liu
Jin-xing Liu