PyTorchKR Papers

최신 논문

총 27편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2201.11147공식 코드 · Papers with Code

OntoProtein: Protein Pretraining With Gene Ontology Embedding

Self-supervised protein language models have proved their effectiveness in learning the proteins representations. With the increasing computational power, current protein language models pre-trained with millions of diverse sequences can advance the parameter scale from million-level to billion-level and achieve remarkable improvement. However, those prevailing approaches rarely consider incorporating knowledge graphs (KGs), which can provide rich structured knowledge facts for better protein representations. We argue that informative biology knowledge in KGs can enhance protein representation with external knowledge. In this work, we propose OntoProtein, the first general framework that makes use of structure in GO (Gene Ontology) into protein pre-training models. We construct a novel large-scale knowledge graph that consists of GO and its related proteins, and gene annotation texts or protein sequences describe all nodes in the graph. We propose novel contrastive learning with knowledge-aware negative sampling to jointly optimize the knowledge graph and protein embedding during pre-training. Experimental results show that OntoProtein can surpass state-of-the-art methods with pre-trained protein language models in TAPE benchmark and yield better performance compared with baselines in protein-protein interaction and protein function prediction. Code and datasets are available in https://github.com/zjunlp/OntoProtein.

arXiv:2112.12033공식 코드 · Papers with Code

Encoding protein dynamic information in graph representation for functional residue identification

Recent advances in protein function prediction exploit graph-based deep learning approaches to correlate the structural and topological features of proteins with their molecular functions. However, proteins in vivo are not static but dynamic molecules that alter conformation for functional purposes. Here we apply normal mode analysis to native protein conformations and augment protein graphs by connecting edges between dynamically correlated residue pairs. In the multilabel function classification task, our method demonstrates a remarkable performance gain based on this dynamics-informed representation. The proposed graph neural network, ProDAR, increases the interpretability and generalizability of residue-level annotations and robustly reflects structural nuance in proteins. We elucidate the importance of dynamic information in graph representation by comparing class activation maps for hMTH1, nitrophorin, and SARS-CoV-2 receptor binding domain. Our model successfully learns the dynamic fingerprints of proteins and pinpoints the residues of functional impacts, with vast untapped potential for broad biotechnology and pharmaceutical applications.

arXiv:1910.06965공식 코드 · Papers with Code

AFDP: An Automated Function Description Prediction Approach to Improve Accuracy of Protein Function Predictions

With the rapid growth in high-throughput biological sequencing technologies and subsequently the amount of produced omics data, it is essential to develop automated methods to annotate the functionality of unknown genes and proteins. There are developed tools such as AHRD applying known proteins characterization to annotate unknown ones. Some other algorithms such as eggNOG apply orthologous groups of proteins to detect the most probable function. However, while the available tools focus on the detection of the most similar characterization, they are not able to generalize and integrate information from multiple homologs while maintaining accuracy. Here, we devise AFDP, an integrated approach for protein function prediction which benefits from the combination of two available tools, AHRD and eggNOG, to predict the functionality of novel proteins and produce more precise human readable descriptions by applying our stCFExt algorithm. StCFExt creates function descriptions applying available manually curated descriptions in swiss-prot. Using a benchmark dataset we show that the annotations predicted by our approach are more accurate than eggNOG and AHRD annotations.

arXiv:2010.10151공식 코드 · Papers with Code

Coherent Hierarchical Multi-Label Classification Networks

Hierarchical multi-label classification (HMC) is a challenging classification task extending standard multi-label classification problems by imposing a hierarchy constraint on the classes. In this paper, we propose C-HMCNN(h), a novel approach for HMC problems, which, given a network h for the underlying multi-label classification problem, exploits the hierarchy information in order to produce predictions coherent with the constraint and improve performance. We conduct an extensive experimental analysis showing the superior performance of C-HMCNN(h) when compared to state-of-the-art models.

arXiv:1906.05017공식 코드 · Papers with Code

Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations

Graph embedding learning that aims to automatically learn low-dimensional node representations, has drawn increasing attention in recent years. To date, most recent graph embedding methods are evaluated on social and information networks and are not comprehensively studied on biomedical networks under systematic experiments and analyses. On the other hand, for a variety of biomedical network analysis tasks, traditional techniques such as matrix factorization (which can be seen as a type of graph embedding methods) have shown promising results, and hence there is a need to systematically evaluate the more recent graph embedding methods (e.g. random walk-based and neural network-based) in terms of their usability and potential to further the state-of-the-art. We select 11 representative graph embedding methods and conduct a systematic comparison on 3 important biomedical link prediction tasks: drug-disease association (DDA) prediction, drug-drug interaction (DDI) prediction, protein-protein interaction (PPI) prediction; and 2 node classification tasks: medical term semantic type classification, protein function prediction. Our experimental results demonstrate that the recent graph embedding methods achieve promising results and deserve more attention in the future biomedical graph analysis. Compared with three state-of-the-art methods for DDAs, DDIs and protein function predictions, the recent graph embedding methods achieve competitive performance without using any biological features and the learned embeddings can be treated as complementary representations for the biological features. By summarizing the experimental results, we provide general guidelines for properly selecting graph embedding methods and setting their hyper-parameters for different biomedical tasks.

arXiv:1905.12265공식 코드 · Papers with Code

Strategies for Pre-training Graph Neural Networks

Many applications of machine learning require a model to make accurate pre-dictions on test examples that are distributionally different from training ones, while task-specific labels are scarce during training. An effective approach to this challenge is to pre-train a model on related tasks where data is abundant, and then fine-tune it on a downstream task of interest. While pre-training has been effective in many language and vision domains, it remains an open question how to effectively use pre-training on graph datasets. In this paper, we develop a new strategy and self-supervised methods for pre-training Graph Neural Networks (GNNs). The key to the success of our strategy is to pre-train an expressive GNN at the level of individual nodes as well as entire graphs so that the GNN can learn useful local and global representations simultaneously. We systematically study pre-training on multiple graph classification datasets. We find that naive strategies, which pre-train GNNs at the level of either entire graphs or individual nodes, give limited improvement and can even lead to negative transfer on many downstream tasks. In contrast, our strategy avoids negative transfer and improves generalization significantly across downstream tasks, leading up to 9.4% absolute improvements in ROC-AUC over non-pre-trained models and achieving state-of-the-art performance for molecular property prediction and protein function prediction.

arXiv:2503.08838v3cs.CL공식 코드 · Papers with Code

PUMA: 돌연변이를 인식하는 단백질 단위 어휘 학습

PUMA: Learning a Mutation-Aware Vocabulary of Protein Units

단백질 서열을 언어로 모델링함으로써 언어 모델(language model)은 계산생물학에서 강력한 도구가 되었으나, 언어 자체에 대한 이해는 여전히 부족합니다. 이를 이해하기 위한 핵심 단계는 구성 단위를 식별하는 것입니다. 자연어에서 형태소가 여러 형태로 나타날 수 있듯이, 단백질에서도 돌연변이로 인해 진화 과정에서 보존되는 단위의 변이가 발생하여 연관된 단위 패밀리(family)를 형성할 수 있습니다. 본 연구에서는 서열로부터 단백질 단위를 학습하고 치환 행렬(substitution matrix)을 활용해 이들의 돌연변이 변이를 탐색함으로써 단위 패밀리의 계통(genealogy)을 형성하는 알고리즘인 PUMA(Protein Units via Mutation-Aware Merging)를 소개합니다. 실험 결과에 따르면 PUMA 패밀리 내에 유지되는 돌연변이는 치환 행렬 단독 예측치보다 양성(benign)인 경우가 더 많으며, PUMA 계통은 단위를 독립적으로 다루는 것에 비해 분자 기능 표현을 향상시키는 것으로 나타났습니다. 한 단위 패밀리에 대한 사례 연구는 상동성(homology)을 넘어선 연관성을 보여줍니다. PUMA는 단백질 언어 모델 토크나이저로 사용될 때 다운스트림 태스크에서 경쟁력 있는 성능을 달성합니다. 또한 단위를 패밀리로 축약함으로써 더 작은 임베딩(embedding) 테이블을 사용하고 더 빠른 학습(training)을 가능하게 합니다. 종합하면, 이러한 결과는 단백질 단위를 돌연변이 변이의 타당한 패밀리로 체계화하는 생물학적으로 기반이 탄탄한 단백질 어휘로서 PUMA를 뒷받침합니다. 소스 코드는 https://github.com/boun-tabi-lifelu/PUMA 에서 확인할 수 있습니다.