Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liangrui Ren

dblp:370/5760 · also Liang-Rui Ren · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
7since 2021 · last 2026
0000-0001-5925-6981ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 77% Computational science and engineering · 23%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › clustering
alternative clustering
2.532026
MLLM Enriched Explainable Multiple Clustering · AAAI 2026
Aligning Contrastive Multiple Clusterings with User Interests · IJCAI 2025
A Diversified Attention Model for Interpretable Multiple Clusterings · IEEE Trans. Knowl. Data Eng. 2023
Data mining
clustering
2.532026
MLLM Enriched Explainable Multiple Clustering · AAAI 2026
Aligning Contrastive Multiple Clusterings with User Interests · IJCAI 2025
A Diversified Attention Model for Interpretable Multiple Clusterings · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering
interpretable clustering
1.722026
MLLM Enriched Explainable Multiple Clustering · AAAI 2026
A Diversified Attention Model for Interpretable Multiple Clusterings · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Aligning Contrastive Multiple Clusterings with User Interests · IJCAI 2025
Data mining
pattern mining
0.912025
Aligning Contrastive Multiple Clusterings with User Interests · IJCAI 2025
Bioinformatics and computational biology › single-cell analysis › single-cell data integration
single-cell multi-omics integration
0.712023
scMCs: a framework for single-cell multi-omics data integration and multiple clusterings · Bioinform. 2023
Data mining › clustering
deep clustering
0.712023
A Diversified Attention Model for Interpretable Multiple Clusterings · IEEE Trans. Knowl. Data Eng. 2023
Computational science and engineering › statistical computing
data imputation
0.212023
scMCs: a framework for single-cell multi-omics data integration and multiple clusterings · Bioinform. 2023

Methods — techniques the papers use, named apart from their topics

data augmentation · 1.7contrastive learning · 1.7prompt-driven reasoning · 1.0multimodal large language model · 1.0cross-attention fusion · 1.0subspace projection · 0.7multi-head attention · 0.7diversified attention · 0.7co-embedding representation · 0.7autoencoder · 0.7
YearPublicationVenuePosition
2026 MLLM Enriched Explainable Multiple Clustering
abstract
Multiple clustering aims to uncover diverse latent structures within the data, enabling a more comprehensive understanding of complex datasets. However, existing approaches either heavily rely on user-supplied keywords or disregard user-interested clustering types, limiting the ability to discover the full range of explainable clusterings of interests, particularly in high-dimensional settings. Furthermore, existing methods insufficiently leverage the rich textual semantics and fall short in fully integrating multi-modal information. To address these challenges, we propose MLLM enriched Multiple Clustering (MLLMMC), a novel framework that leverages multi-modal large language model (MLLM) to explore explainable non-redundant clustering. Specifically, MLLMMC first employs MLLM to generate sample descriptions, which serve as input for LLM to perform prompt-driven reasoning and infer latent clustering types, and then merges them with user-interested types to obtain diverse and explainable clustering types. For each selected type, MLLMMC utilizes MLLM to generate sample-level textual descriptions and aligns them with corresponding visual features through a cross-attention fusion module, which produces a semantically aligned and enriched representation for the target clustering type. Extensive experiments on six benchmark datasets from diverse domains demonstrate that MLLMMC achieves diverse, explainable, and high-quality clustering outcomes, outperforming state-of-the-art multiple clustering methods with a large margin.
Liangrui Ren, Qiaoyu Tan, Carlotta Domeniconi, Wei Du 0010, Jun Wang 0035, Guoxian Yu
AAAI2
2025 Aligning Contrastive Multiple Clusterings with User Interests
abstract
Multiple clustering approaches aim to partition complex data in different ways. These methods often exhibit a one-to-many relationship in their results, and relying solely on the data context may be insufficient to capture the patterns relevant to the user. User’s expectation is key for the multiple clustering task. Two main challenges exist: identifying the significant features to represent user interests and aligning those interests with the clustering results. To address this issue, we propose Contrastive Multiple Clusterings (CMClusts), which extends contrastive learning to multiple clustering by elevating traditional instance-level contrast to clustering-level contrast. Furthermore, CMClusts integrates user expectations or interests by extracting desired features through tailored data augmentations, enabling the model to effectively capture user-relevant clustering features. Experimental results on benchmark datasets show that CMClusts can generate interpretable and high-quality clusterings, which reflect different user interests.
Liangrui Ren, Jun Wang 0035, Carlotta Domeniconi, Guoxian Yu
IJCAI2
2023 scMCs: a framework for single-cell multi-omics data integration and multiple clusterings
abstract
MOTIVATION: The integration of single-cell multi-omics data can uncover the underlying regulatory basis of diverse cell types and states. However, contemporary methods disregard the omics individuality, and the high noise, sparsity, and heterogeneity of single-cell data also impact the fusion effect. Furthermore, available single-cell clustering methods only focus on the cell type clustering, which cannot mine the alternative clustering to comprehensively analyze cells. RESULTS: We propose a single-cell data fusion based multiple clustering (scMCs) approach that can jointly model single-cell transcriptomics and epigenetic data, and explore multiple different clusterings. scMCs first mines the omics-specific and cross-omics consistent representations, then fuses them into a co-embedding representation, which can dissect cellular heterogeneity and impute data. To discover the potential alternative clustering embedded in multi-omics, scMCs projects the co-embedding representation into different salient subspaces. Meanwhile, it reduces the redundancy between subspaces to enhance the diversity of alternative clusterings and optimizes the cluster centers in each subspace to boost the quality of corresponding clustering. Unlike single clustering, these alternative clusterings provide additional perspectives for understanding complex genetic information, such as cell types and states. Experimental results show that scMCs can effectively identify subcellular types, impute dropout events, and uncover diverse cell characteristics by giving different but meaningful clusterings. AVAILABILITY AND IMPLEMENTATION: The code is available at www.sdu-idea.cn/codes.php?name=scMCs.
Liangrui Ren, Jun Wang 0035, Zhao Li 0007, Qingzhong Li, Guoxian Yu
Bioinform.1
2023 A Diversified Attention Model for Interpretable Multiple Clusterings
abstract
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 namediMClusts(interpretableMultipleClusteringsby 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.
Liangrui Ren, Guoxian Yu, Jun Wang 0035, Lei Liu 0003, Carlotta Domeniconi, Xiangliang Zhang 0001
IEEE Trans. Knowl. Data Eng.1
2022 Kernel risk-sensitive mean p-power loss based hyper-graph regularized robust extreme learning machine and its semi-supervised extension for sample classification
Zhen-Xin Niu, Cui-Na Jiao, Liangrui Ren, Juan Wang 0003, Jin-Xing Liu 0001
Appl. Intell.3
2021 Extreme Learning Machine Based on Double Kernel Risk-Sensitive Loss for Cancer Samples Classification
Zhen-Xin Niu, Liangrui Ren, Xiang-Zhen Kong, Ying-Lian Gao, Jin-Xing Liu 0001
ICIC (2)2
2021 Kernel Risk-Sensitive Loss based Hyper-graph Regularized Robust Extreme Learning Machine and Its Semi-supervised Extension for Classification
Liangrui Ren, Jin-Xing Liu 0001, Ying-Lian Gao, Xiang-Zhen Kong, Chun-Hou Zheng 0001
Knowl. Based Syst.1
2020 Robust Graph Regularized Extreme Learning Machine Auto Encoder and Its Application to Single-Cell Samples Classification
Liangrui Ren, Jin-Xing Liu 0001, Ying-Lian Gao, Xiang-Zhen Kong, Chun-Hou Zheng 0001
ICIC (2)1
2020 Correntropy induced loss based sparse robust graph regularized extreme learning machine for cancer classification
abstract
Abstract 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.
Liangrui Ren, Ying-Lian Gao, Jin-Xing Liu 0001, Junliang Shang, Chun-Hou Zheng 0001
BMC Bioinform.1