{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/drug-target-interaction-prediction-with-graph","title":"Drug-Target Interaction Prediction with Graph Attention networks","arxiv_id":"2107.06099","date":"2021-07-10","proceeding":null,"authors":["Haiyang Wang","Guangyu Zhou","SiQi Liu","Jyun-Yu Jiang","Wei Wang"],"abstract":"Motivation: Predicting Drug-Target Interaction (DTI) is a well-studied topic in bioinformatics due to its relevance in the fields of proteomics and pharmaceutical research. Although many machine learning methods have been successfully applied in this task, few of them aim at leveraging the inherent heterogeneous graph structure in the DTI network to address the challenge. For better learning and interpreting the DTI topological structure and the similarity, it is desirable to have methods specifically for predicting interactions from the graph structure. Results: We present an end-to-end framework, DTI-GAT (Drug-Target Interaction prediction with Graph Attention networks) for DTI predictions. DTI-GAT incorporates a deep neural network architecture that operates on graph-structured data with the attention mechanism, which leverages both the interaction patterns and the features of drug and protein sequences. DTI-GAT facilitates the interpretation of the DTI topological structure by assigning different attention weights to each node with the self-attention mechanism. Experimental evaluations show that DTI-GAT outperforms various state-of-the-art systems on the binary DTI prediction problem. Moreover, the independent study results further demonstrate that our model can be generalized better than other conventional methods. Availability: The source code and all datasets are available at https://github.com/Haiyang-W/DTI-GRAPH","url_abs":"https://arxiv.org/abs/2107.06099v1","url_pdf":"https://arxiv.org/pdf/2107.06099v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"drug-target-interaction-prediction-with-graph","repo_url":"https://github.com/Haiyang-W/DTI-GRAPH","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2107.06099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06099"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Haiyang-W/DTI-GRAPH","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":8},"by_repo_kind":{"official":{"samples":8,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"94ad845ffe086146","entry":"accuracy","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"94ad845ffe086146"}},{"code_sha256_prefix":"5b1b003322c4b1ae","entry":"add_dti_info","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"processdata.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/processdata.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5b1b003322c4b1ae"}},{"code_sha256_prefix":"b93e3f4109f40d06","entry":"cmp_time","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/dataloader.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b93e3f4109f40d06"}},{"code_sha256_prefix":"02d3925c94f19906","entry":"convert","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"processdata.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/processdata.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"02d3925c94f19906"}},{"code_sha256_prefix":"9f0c1caa239cb57d","entry":"pad_tensor","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/dataloader.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9f0c1caa239cb57d"}},{"code_sha256_prefix":"fc7eb812c97ec877","entry":"padding_all","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/dataloader.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fc7eb812c97ec877"}},{"code_sha256_prefix":"4bede4f0f2850885","entry":"precision","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4bede4f0f2850885"}},{"code_sha256_prefix":"aed8427f22276bff","entry":"recall","repo":"Haiyang-W/DTI-GRAPH","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"aed8427f22276bff"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}