Zhen Tian

Dr. Zhen Tian

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
6 May 2022 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
ZLZhengzheng Lou
Zhengzheng Lou
ZCZhaoxu Cheng
Zhaoxu Cheng
HLHui Li
Hui Li
ZTZhixia Teng
Zhixia Teng
YLYang Liu
Yang Liu
ZTZhen Tian
Zhen Tian
Motivation: In recent years, a large number of biological experiments have strongly shown that miRNAs play an important role in understanding disease pathogenesis. The discovery of miRNA–disease associations is beneficial for disease diagnosis and treatment. Since inferring these associations through biological experiments is time-consuming and expensive, researchers have sought to identify the associations utilizing computational approaches. Graph Convolutional Networks (GCNs), which exhibit excellent performance in link prediction problems, have been successfully used in miRNA–disease association prediction. However, GCNs only consider 1st-order neighborhood information at one layer but fail to capture information from high-order neighbors to learn miRNA and disease representations through information propagation. Therefore, how to aggregate information from high-order neighborhood effectively in an explicit way is still challenging.Results: To address such a challenge, we propose a novel method called mixed neighborhood information for miRNA–disease association (MINIMDA), which could fuse mixed high-order neighborhood information of miRNAs and diseases in multimodal networks. First, MINIMDA constructs the integrated miRNA similarity network and integrated disease similarity network respectively with their multisource information. Then, the embedding representations of miRNAs and diseases are obtained by fusing mixed high-order neighborhood information from multimodal network which are the integrated miRNA similarity network, integrated disease similarity network and the miRNA–disease association networks. Finally, we concentrate the multimodal embedding representations of miRNAs and diseases and feed them into the multilayer perceptron (MLP) to predict their underlying associations. Extensive experimental results show that MINIMDA is superior to other state-of-the-art methods overall. Moreover, the outstanding performance on case studies for esophageal cancer, colon tumor and lung cancer further demonstrates the effectiveness of MINIMDA.Availability and implementation: https://github.com/chengxu123/MINIMDA and http://120.79.173.96/

3 June 2024 in Bioinformatics
Verified
Journal Article
Open access
PDF file
WSWei Song
Wei Song
LXLewen Xu
Lewen Xu
CHChenguang Han
Chenguang Han
ZTZhen Tian
Zhen Tian
Quan ZouQuan Zou
Quan Zou
Motivation: Accurately identifying the drug–target interactions (DTIs) is one of the crucial steps in the drug discovery and drug repositioning process. Currently, many computational-based models have already been proposed for DTI prediction and achieved some significant improvement. However, these approaches pay little attention to fuse the multi-view similarity networks related to drugs and targets in an appropriate way. Besides, how to fully incorporate the known interaction relationships to accurately represent drugs and targets is not well investigated. Therefore, there is still a need to improve the accuracy of DTI prediction models. Results: In this study, we propose a novel approach that employs Multi-view similarity network fusion strategy and deep Interactive attention mechanism to predict Drug–Target Interactions (MIDTI). First, MIDTI constructs multi-view similarity networks of drugs and targets with their diverse information and integrates these similarity networks effectively in an unsupervised manner. Then, MIDTI obtains the embeddings of drugs and targets from multi-type networks simultaneously. After that, MIDTI adopts the deep interactive attention mechanism to further learn their discriminative embeddings comprehensively with the known DTI relationships. Finally, we feed the learned representations of drugs and targets to the multilayer perceptron model and predict the underlying interactions. Extensive results indicate that MIDTI significantly outperforms other baseline methods on the DTI prediction task. The results of the ablation experiments also confirm the effectiveness of the attention mechanism in the multi-view similarity network fusion strategy and the deep interactive attention mechanism. Availability and implementation: https://github.com/XuLew/MIDTI.

14 October 2022 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
ZTZhen Tian
Zhen Tian
XPXiangyu Peng
Xiangyu Peng
HFHaichuan Fang
Haichuan Fang
WZWenjie Zhang
Wenjie Zhang
QDQiguo Dai
Qiguo Dai
YYYangdong Ye
Yangdong Ye
Discovering the drug–target interactions (DTIs) is a crucial step in drug development such as the identification of drug side effects and drug repositioning. Since identifying DTIs by web-biological experiments is time-consuming and costly, many computational-based approaches have been proposed and have become an efficient manner to infer the potential interactions. Although extensive effort is invested to solve this task, the prediction accuracy still needs to be improved. More especially, heterogeneous network-based approaches do not fully consider the complex structure and rich semantic information in these heterogeneous networks. Therefore, it is still a challenge to predict DTIs efficiently. In this study, we develop a novel method via Multiview heterogeneous information network embedding with Hierarchical Attention mechanisms to discover potential Drug–Target Interactions (MHADTI). Firstly, MHADTI constructs different similarity networks for drugs and targets by utilizing their multisource information. Combined with the known DTI network, three drug–target heterogeneous information networks (HINs) with different views are established. Secondly, MHADTI learns embeddings of drugs and targets from multiview HINs with hierarchical attention mechanisms, which include the node-level, semantic-level and graph-level attentions. Lastly, MHADTI employs the multilayer perceptron to predict DTIs with the learned deep feature representations. The hierarchical attention mechanisms could fully consider the importance of nodes, meta-paths and graphs in learning the feature representations of drugs and targets, which makes their embeddings more comprehensively. Extensive experimental results demonstrate that MHADTI performs better than other SOTA prediction models. Moreover, analysis of prediction results for some interested drugs and targets further indicates that MHADTI has advantages in discovering DTIs. https://github.com/pxystudy/MHADTI

4 March 2025 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PZPengfei Zhu
Pengfei Zhu
HSHan Shu
Han Shu
YWYongtian Wang
Yongtian Wang
XWXiaofeng Wang
Xiaofeng Wang
YZYuan Zhao
Yuan Zhao
Tao WangTao Wang
Tao Wang
Spatial transcriptomics (ST) technology provides gene expression profiles with spatial context, offering critical insights into cellular interactions and tissue architecture. A core task in ST is spatial domain identification, which involves detecting coherent regions with similar spatial expression patterns. However, existing methods often fail to fully exploit spatial information, leading to limited representational capacity and suboptimal clustering accuracy. Here, we introduce MAEST, a novel graph neural network model designed to address these limitations in ST data. MAEST leverages graph masked autoencoders to denoise and refine representations while incorporating graph contrastive learning to prevent feature collapse and enhance model robustness. By integrating one-hop and multi-hop representations, MAEST effectively captures both local and global spatial relationships, improving clustering precision. Extensive experiments across diverse datasets, including the human brain, mouse hippocampus, olfactory bulb, brain, and embryo, demonstrate that MAEST outperforms seven state-of-the-art methods in spatial domain identification. Furthermore, MAEST showcases its ability to integrate multi-slice data, identifying joint domains across horizontal tissue sections with high accuracy. These results highlight MAEST’s versatility and effectiveness in unraveling the spatial organization of complex tissues. The source code of MAEST can be obtained at https://github.com/clearlove2333/MAEST.

31 December 2018 in BMC Systems Biology
Verified
Journal Article
Open access
PDF file
ZTZhen Tian
Zhen Tian
TTtengteng Teng
tengteng Teng
SCShuang Cheng
Shuang Cheng
MGMaozu Guo
Maozu Guo
Drug repositioning is a promising and efficient way to discover new indications for existing drugs, which holds the great potential for precision medicine in the post-genomic era. Many network-based approaches have been proposed for drug repositioning based on similarity networks, which integrate multiple sources of drugs and diseases. However, these methods may simply view nodes as the same-typed and neglect the semantic meanings of different meta-paths in the heterogeneous network. Therefore, it is urgent to develop a rational method to infer new indications for approved drugs. In this study, we proposed a novel methodology named HeteSim_DrugDisease (HSDD) for the prediction of drug repositioning. Firstly, we build the drug-drug similarity network and disease-disease similarity network by integrating the information of drugs and diseases. Secondly, a drug-disease heterogeneous network is constructed, which combines the drug similarity network, disease similarity network as well as the known drug-disease association network. Finally, HSDD predicts novel drug-disease associations based on the HeteSim scores of different meta-paths. The experimental results show that HSDD performs significantly better than the existing state-of-the-art approaches. HSDD achieves an AUC score of 0.8994 in the leave-one-out cross validation experiment. Moreover, case studies for selected drugs further illustrate the practical usefulness of HSDD. HSDD can be an effective and feasible way to infer the associations between drugs and diseases using on meta-path-based semantic network analysis.

31 January 2025 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
XYXiaoqiang Yan
Xiaoqiang Yan
KDKun Deng
Kun Deng
Quan ZouQuan Zou
Quan Zou
ZTZhen Tian
Zhen Tian
Hui YuHui Yu
Hui Yu
Contrastive graph clustering (CGC) has become a prominent method for self-supervised representation learning by contrasting augmented graph data pairs. However, the performance of CGC methods critically depends on the choice of data augmentation, which usually limits the capacity of network generalization. Besides, most existing methods characterize positive and negative samples based on the nodes themselves, ignoring the influence of neighbors with different hop numbers on the node. In this study, a novel self-cumulative contrastive graph clustering (SC-CGC) method is devised, which is capable of dynamically adjusting the influence of neighbors with different hops. Our intuition is that better neighbors are closer and distant ones are further away in their feature space, thus we can perform neighbor contrasting without data augmentation. To be specific, SC-CGC relies on two neural networks, i.e., autoencoder network (AE) and graph autoencoder network (GAE), to encode the node information and graph structure, respectively. To make these two networks interact and learn from each other, a dynamic fusion mechanism is devised to transfer the knowledge learned by AE to the corresponding GAE layer by layer. Then, a self-cumulative contrastive loss function is designed to characterize the structural information by dynamically accumulating the influence of the nodes with different hops. Finally, our approach simultaneously refines the representation learning and clustering assignments in a self-supervised manner. Extensive experiments on 8 realistic datasets demonstrate that SC-CGC consistently performs better over SOTA techniques.