Making medication prescriptions in response to the patient's diagnosis is a challenging task. The number of pharmaceutical companies, their inventory of medicines, and the recommended dosage confront a doctor with the well-known problem of information and cognitive overload. To assist a medical practitioner in making informed decisions regarding a medical prescription to a patient, researchers have exploited electronic health records (EHRs) in automatically recommending medication. In recent years, medication recommendation using EHRs has been a salient research direction, which has attracted researchers to apply various deep learning (DL) models to the EHRs of patients in recommending prescriptions. Yet, in the absence of a holistic survey article, it needs a lot of effort and time to study these publications in order to understand the current state of research and identify the best-performing models along with the trends and challenges. To fill this research gap, this survey reports on state-of-the-art DL-based medication recommendation methods. It reviews the classification of DL-based medication recommendation (MR) models, compares their performance, and the unavoidable issues they face. It reports on the most common datasets and metrics used in evaluating MR models. The findings of this study have implications for researchers interested in MR models.
With the continuous development of intelligent technologies, knowledge graph, the backbone of artificial intelligence, has attracted much attention from both academic and industrial communities due to its powerful capability of knowledge representation and reasoning. In recent years, knowledge graph has been widely applied in different kinds of applications, such as semantic search, question answering, knowledge management and so on. Techniques for building Chinese knowledge graphs are also developing rapidly and different Chinese knowledge graphs have been constructed to support various applications. Under the background of the “One Belt One Road (OBOR)” initiative, cooperating with the countries along OBOR on studying knowledge graph techniques and applications will greatly promote the development of artificial intelligence. At the same time, the accumulated experience of China in developing knowledge graphs is also a good reference to develop non-English knowledge graphs. In this paper, we aim to introduce the techniques of constructing Chinese knowledge graphs and their applications, as well as analyse the impact of knowledge graph on OBOR. We first describe the background of OBOR, and then introduce the concept and development history of knowledge graph and typical Chinese knowledge graphs. Afterwards, we present the details of techniques for constructing Chinese knowledge graphs, and demonstrate several applications of Chinese knowledge graphs. Finally, we list some examples to explain the potential impacts of knowledge graph on OBOR.
1 August 2023 in IEEE Transactions on Knowledge and Data Engineering
Possibilistic logic provides a convenient tool for dealing with uncertainty and handling inconsistency. In this paper, we propose possibilistic description logics as an extension of description logics, which are a family of well-known ontology languages. We first give the syntax and semantics of possibilistic description logics and define several inference services in possibilistic description logics. We show that these inference serviced can be reduced to the task of computing the inconsistency degree of a knowledge base in possibilistic description logics. Since possibilistic inference services suffer from the drowning problem, that is, axioms whose confidence degrees are less than or equal to the inconsistency are not used, we consider a drowning-free variant of possibilistic inference, called linear order inference. We propose an algorithm for computing the inconsistency degree of a possibilistic description logic knowledge base and an algorithm for the linear order inference. We consider the impact of our possibilistic description logics on ontology learning and ontology merging. Finally, we implement these algorithms and provide some interesting evaluation results.