| dc.contributor | 企管系 | |
| dc.creator (作者) | 侯佩妤 | |
| dc.creator (作者) | Hou, Pei-Yu;Korn, Daniel;Schatz, Kara;Beasley, Jon-Michael;Tropsha, Alexander;Chirkova, Rada | |
| dc.date (日期) | 2025-01 | |
| dc.date.accessioned | 24-Sep-2025 09:53:48 (UTC+8) | - |
| dc.date.available | 24-Sep-2025 09:53:48 (UTC+8) | - |
| dc.date.issued (上傳時間) | 24-Sep-2025 09:53:48 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/159638 | - |
| dc.description.abstract (摘要) | To accelerate the time- and labor-intensive processes of drug discovery and repurposing, it is increasingly common to mine knowledge sources for connections between diseases and the drugs that can treat them. In this article we address the scalability challenge in the connection mining, by introducing algorithms that can be used to find plausible mechanistic connections between drugs and the potentially associated diseases in biomedical knowledge graphs. These connections are then presented to biomedical experts as candidate hypotheses for further studies of whether the drugs can be repurposed to treat the diseases. One challenge that has to be addressed in this effort is the processing of promiscuous knowledge-graph nodes, that is, nodes associated with numerous relationships that may not be unique or indicative of the node properties. As it turns out, the multiplicity of relationships involving promiscuous graph nodes may prevent the aforementioned path-finding algorithms from aiding in drug repurposing. To address the promiscuous-node challenge, we introduce promiscuity scores for nodes and paths in knowledge graphs, and incorporate the scores in the proposed path-finding algorithms. We report experimental results that indicate that paths with low-promiscuity scores could be meaningful and of interest to biomedical experts in drug repurposing. | |
| dc.format.extent | 95 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | ACM Transactions on Computing for Healthcare, Vol.6, No.1, Article No.8, pp.1-32 | |
| dc.subject (關鍵詞) | Biomedical knowledge graphs; drug repurposing; path-finding knowledge-graph algorithms | |
| dc.title (題名) | Towards Improving the Efficiency of Drug Repurposing by Leveraging Node Promiscuity in Biomedical Knowledge Graphs | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1145/3707650 | |
| dc.doi.uri (DOI) | https://doi.org/10.1145/3707650 | |
