Jian Liu

Dr. Jian Liu

School of Information and Control Engineering, China University of Mining and Technology

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
16 October 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Xuesong WangXuesong Wang
Xuesong Wang
JLJian Liu
Jian Liu
YCYuhu Cheng
Yuhu Cheng
ALAiping Liu
Aiping Liu
ECEnhong Chen
Enhong Chen
Clustering is a powerful approach to analyze gene expression data which is crucial to the investigation of effective treatment of cancer. Many graph regularize-based clustering methods have been proposed and shown to be superior to the traditional clustering methods. However, they only focus on the inner structure in samples and fail to take the feature manifold into account. In gene expression data, it's practical to hypothesize that both the samples and the genes lie on nonlinear low dimensional manifolds, namely sample manifold and gene manifold respectively. Therefore in this paper, incorporating the geometric structures in both samples and features, we propose a Dual Hypergraph Regularized PCA (DHPCA) method for biclustering of tumor data. Firstly, for gene expression data, we construct two hypergraphs, i.e. sample hypergraph and gene hypergraph, to estimate the intrinsic geometric structures of samples and genes. Then we introduce the hypergraph regularization on both gene side and sample side. Finally, our biclustering method is formulated as two hypergraph regularized PCA with closed-form solution. We experimentally validate our proposed DHPCA algorithm on real applications and the promising results indicate its potential in high dimension data analysis.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
JLJian Liu
Jian Liu
LFLiming Feng
Liming Feng
The reinforcement learning algorithms based on policy gradient may fall into local optimal due to gradient disappearance during the update process, which in turn affects the exploration ability of the reinforcement learning agent. In order to solve the above problem, in this paper, the cross‐entropy method (CEM) in evolution policy, maximum mean difference (MMD), and twin delayed deep deterministic policy gradient algorithm (TD3) are combined to propose a diversity evolutionary policy deep reinforcement learning (DEPRL) algorithm. By using the maximum mean discrepancy as a measure of the distance between different policies, some of the policies in the population maximize the distance between them and the previous generation of policies while maximizing the cumulative return during the gradient update. Furthermore, combining the cumulative returns and the distance between policies as the fitness of the population encourages more diversity in the offspring policies, which in turn can reduce the risk of falling into local optimal due to the disappearance of the gradient. The results in the MuJoCo test environment show that DEPRL has achieved excellent performance on continuous control tasks; especially in the Ant‐v2 environment, the return of DEPRL ultimately achieved a nearly 20% improvement compared to TD3.

18 August 2021 in Scientific Programming
Verified
Journal Article
Open access
PDF file
JLJian Liu
Jian Liu
WLWenfeng Liu
Wenfeng Liu
YCYuhu Cheng
Yuhu Cheng
SGShuguang Ge
Shuguang Ge
Xuesong WangXuesong Wang
Xuesong Wang
It is a crucial task to design an integrated method to discover cancer subtypes and understand the heterogeneity of cancer based on multiple genomic data. In recent years, some clustering algorithms have been proposed and applied to cancer subtype prediction. Among them, similarity network fusion (SNF) can integrate multiple types of genomic data to identify cancer subtypes, which improves the understanding of tumorigenesis. SNF uses a dense similarity matrix to obtain the global information of the data, and the interconnection of samples between different categories will cause noise interference. Therefore, how to construct a more robust dense similarity matrix is an important research content to improve the performance of cancer subtype identification. In this paper, we proposed similarity network fusion based on random walk and relative entropy (R2SNF) for cancer subtype prediction. Firstly, the random walk algorithm was used to capture the complex relationship between samples in each genomic data. And the transition probability distribution of samples in the network was obtained. If two samples belong to the same class, the transition probability between the two samples is great. On the contrary, if the two samples do not belong to the same class, the transition probability between the two samples is small. In this way, the degree of correlation between samples can be well obtained, thereby reducing the noise interference caused by the interconnection of samples between different categories. Secondly, relative entropy was used to calculate the difference in the transition probability distribution between samples to construct a better dense similarity matrix which contains structural similarity information between samples. Thirdly, we iteratively fused the obtained dense similarity matrix with the KNN similarity matrix to construct the fused similarity matrix of all genomic data. Finally, by using spectral clustering, the fused similarity matrix was grouped into multiple clusters, which indicates the cancer subtypes. Experiments on seven cancer omics datasets show that the R2SNF algorithm performs well in identifying cancer subtypes.

1 July 2018 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
JLJian Liu
Jian Liu
YCYuhu Cheng
Yuhu Cheng
Xuesong WangXuesong Wang
Xuesong Wang
XCXiaoluo Cui
Xiaoluo Cui
A reliable and precise recognition of the differentially expressed genes of tumor is crucial to treat the cancer effectively. The small number of differentially expressed genes in a huge gene expression dataset determines the important role of sparse methods, such as Penalty matrix decomposition (PMD), among the feature selection methods. The sparse methods always have the drawback: they do not take advantage of known class labels of gene expression data. A novel supervised-sparse method named as Supervised PMD (SPMD) is proposed by adding the class information into PMD via the total scatter matrix. The brief idea of our method used to select the differentially expressed genes is given as follows. The total scatter matrix is obtained according to the gene expression data with class label. The obtained total scatter matrix is decomposed by PMD to acquire the sparse vectors. The non-zero items in sparse vectors are selected as the differentially expressed genes. The Gene ontology (GO) enrichment of functional annotation of the selected genes is detected by ToppFun. Experiments on synthetic data and two real tumor gene expression datasets show that the proposed SPMD is quite promising to select the differentially expressed genes.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
JLJian Liu
Jian Liu
YCYuhu Cheng
Yuhu Cheng
Xuesong WangXuesong Wang
Xuesong Wang
SGShuguang Ge
Shuguang Ge
Clustering of tumor samples can help identify cancer types and discover new cancer subtypes, which is essential for effective cancer treatment. Although many traditional clustering methods have been proposed for tumor sample clustering, advanced algorithms with better performance are still needed. Low‐rank subspace clustering is a popular algorithm in recent years. In this paper, we propose a novel one‐step robust low‐rank subspace segmentation method (ORLRS) for clustering the tumor sample. For a gene expression data set, we seek its lowest rank representation matrix and the noise matrix. By imposing the discrete constraint on the low‐rank matrix, without performing spectral clustering, ORLRS learns the cluster indicators of subspaces directly, i.e., performing the clustering task in one step. To improve the robustness of the method, capped norm is adopted to remove the extreme data outliers in the noise matrix. Furthermore, we conduct an efficient solution to solve the problem of ORLRS. Experiments on several tumor gene expression data demonstrate the effectiveness of ORLRS.

5 August 2025 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Closed access
JLJian Liu
Jian Liu
XXXu Xizhen
Xu Xizhen
YYYuqi Yan
Yuqi Yan
QSQian Song
Qian Song
YCYuhu Cheng
Yuhu Cheng
DXDong Xu
Dong Xu