Kody Moodley
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kody Moodley has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Gijs van Dijck
Law & Tech Lab, Maastricht University, Maastricht, Netherlands
2 shared publications Michel Dumontier
Institute of Data Science, Maastricht University, Paul-Henri Spaaklaan 1, 6229 GT, Maastricht, The Netherlands
2 shared publicationsThomas Meyer
University of Cape Town
2 shared publications- Ulrike Sattler
The University of Manchester, Manchester, United Kingdom
2 shared publications - Amrapali Zaveri
Institute of Data Science, Maastricht University, Maastricht, Netherlands
1 shared publication - Christian Pipal
University of Zürich
1 shared publication
Latest Publications
- Open Access
- 18 January 2024
- Published by Center for Open Science in PsyArXiv
MEXCA - A Simple and Robust Pipeline for Capturing Emotion Expressions in Faces, Vocalization, and Speech
MEXCA is an easy-to-use tool researchers can use to capture emotion expressions from multiple modalities in videos. It overcomes limitations of previous software by combining existing unimodal systems to ultimately extract three modalities: Facial muscle movements, vocalizations, and speech content. Moreover, it can also track faces and speakers in the video. We describe the software's architecture and features and show how its output can be used to analyze emotion expressions in a Dutch election debate. We think MEXCA has great potential impact in the social sciences because it allows researchers to automatically capture emotion expressions on a large scale across individuals and contexts.
- 18 January 2024
- Published by Center for Open Science in PsyArXiv
Open AccessMEXCA - A Simple and Robust Pipeline for Capturing Emotion Expressions in Faces, Vocalization, and Speech
MEXCA is an easy-to-use tool researchers can use to capture emotion expressions from multiple modalities in videos. It overcomes limitations of previous software by combining existing unimodal systems to ultimately extract three modalities: Facial muscle movements, vocalizations, and speech content. Moreover, it can also track faces and speakers in the video. We describe the software's architecture and features and show how its output can be used to analyze emotion expressions in a Dutch election debate. We think MEXCA has great potential impact in the social sciences because it allows researchers to automatically capture emotion expressions on a large scale across individuals and contexts.
- Open Access
- 12 February 2021
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 12 (1) , 1-15
InContext: curation of medical context for drug indications
Accurate and precise information about the therapeutic uses (indications) of a drug is essential for applications in drug repurposing and precision medicine. Leading online drug resources such as DrugCentral and DrugBank provide rich information about various properties of drugs, including their indications. However, because indications in such databases are often partly automatically mined, some may prove to be inaccurate or imprecise. Particularly challenging for text mining methods is the task of distinguishing between general disease mentions in drug product labels and actual indications for the drug. For this, the qualifying medical context of the disease mentions in the text should be studied. Some examples include contraindications, co-prescribed drugs and target patient qualifications. No existing indication curation efforts attempt to capture such information in a precise way. Here we fill this gap by presenting a novel curation protocol for extracting indications and machine processable annotations of contextual information about the therapeutic use of a drug. We implemented the protocol on a reference set of FDA-approved drug product labels on the DailyMed website to curate indications for 150 anti-cancer and cardiovascular drugs. The resulting corpus - InContext - focuses on anti-cancer and cardiovascular drugs because of the heightened societal interest in cancer and heart disease. In order to understand how InContext relates with existing reputable drug indication databases, we analysed it’s overlap with a state-of-the-art indications database - LabeledIn - as well as a reputable online drug compendium - DrugCentral. We found that 40% of indications sampled from DrugCentral (and 23% from LabeledIn) respectively, could not be accounted for in InContext. This raises questions about the veracity of indications not appearing in InContext. The additional contextual information curated by InContext about disease mentions in drug SPLs provides a foundation for more precise, structured and formal representations of knowledge related to drug therapeutic use, in order to increase accuracy and agreement of drug indication extraction methods for in silico drug repurposing.
- 12 February 2021
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 12 (1) , 1-15
Open AccessInContext: curation of medical context for drug indications
Accurate and precise information about the therapeutic uses (indications) of a drug is essential for applications in drug repurposing and precision medicine. Leading online drug resources such as DrugCentral and DrugBank provide rich information about various properties of drugs, including their indications. However, because indications in such databases are often partly automatically mined, some may prove to be inaccurate or imprecise. Particularly challenging for text mining methods is the task of distinguishing between general disease mentions in drug product labels and actual indications for the drug. For this, the qualifying medical context of the disease mentions in the text should be studied. Some examples include contraindications, co-prescribed drugs and target patient qualifications. No existing indication curation efforts attempt to capture such information in a precise way. Here we fill this gap by presenting a novel curation protocol for extracting indications and machine processable annotations of contextual information about the therapeutic use of a drug. We implemented the protocol on a reference set of FDA-approved drug product labels on the DailyMed website to curate indications for 150 anti-cancer and cardiovascular drugs. The resulting corpus - InContext - focuses on anti-cancer and cardiovascular drugs because of the heightened societal interest in cancer and heart disease. In order to understand how InContext relates with existing reputable drug indication databases, we analysed it’s overlap with a state-of-the-art indications database - LabeledIn - as well as a reputable online drug compendium - DrugCentral. We found that 40% of indications sampled from DrugCentral (and 23% from LabeledIn) respectively, could not be accounted for in InContext. This raises questions about the veracity of indications not appearing in InContext. The additional contextual information curated by InContext about disease mentions in drug SPLs provides a foundation for more precise, structured and formal representations of knowledge related to drug therapeutic use, in order to increase accuracy and agreement of drug indication extraction methods for in silico drug repurposing.
- Open Access
- 4 November 2019
- Published by Cambridge University Press (CUP) in European Journal of Risk Regulation
- Vol. 11 (1) , 70-93
The Case for a Linked Data Research Engine for Legal Scholars
This contribution explores the application of data science and artificial intelligence to legal research, more specifically an element that has not received much attention: the research infrastructure required to make such analysis possible. In recent years, EU law has become increasingly digitised and published in online databases such as EUR-Lex and HUDOC. However, the main barrier inhibiting legal scholars from analysing this information is lack of training in data analytics. Legal analytics software can mitigate this problem to an extent. However, current systems are dominated by the commercial sector. In addition, most systems focus on search of legal information but do not facilitate advanced visualisation and analytics. Finally, free to use systems that do provide such features are either too complex to use for general legal scholars, or are not rich enough in their analytics tools. In this paper, we motivate the case for building a software platform that addresses these limitations. Such software can provide a powerful platform for visualising and exploring connections and correlations in EU case law, helping to unravel the “DNA” behind EU legal systems. It will also serve to train researchers and students in schools and universities to analyse legal information using state-of-the-art methods in data science, without requiring technical proficiency in the underlying methods. We also suggest that the software should be powered by a data infrastructure and management paradigm following the seminal FAIR (Findable, Accessible, Interoperable and Reusable) principles.
- 4 November 2019
- Published by Cambridge University Press (CUP) in European Journal of Risk Regulation
- Vol. 11 (1) , 70-93
Open AccessThe Case for a Linked Data Research Engine for Legal Scholars
This contribution explores the application of data science and artificial intelligence to legal research, more specifically an element that has not received much attention: the research infrastructure required to make such analysis possible. In recent years, EU law has become increasingly digitised and published in online databases such as EUR-Lex and HUDOC. However, the main barrier inhibiting legal scholars from analysing this information is lack of training in data analytics. Legal analytics software can mitigate this problem to an extent. However, current systems are dominated by the commercial sector. In addition, most systems focus on search of legal information but do not facilitate advanced visualisation and analytics. Finally, free to use systems that do provide such features are either too complex to use for general legal scholars, or are not rich enough in their analytics tools. In this paper, we motivate the case for building a software platform that addresses these limitations. Such software can provide a powerful platform for visualising and exploring connections and correlations in EU case law, helping to unravel the “DNA” behind EU legal systems. It will also serve to train researchers and students in schools and universities to analyse legal information using state-of-the-art methods in data science, without requiring technical proficiency in the underlying methods. We also suggest that the software should be powered by a data infrastructure and management paradigm following the seminal FAIR (Findable, Accessible, Interoperable and Reusable) principles.
- Open Access
Theoretical Foundations of Defeasible Description Logics
We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional case. In particular, we consider a natural and intuitive semantics for defeasible subsumption, and investigate KLM-style syntactic properties for both preferential and rational subsumption. Our contribution includes two representation results linking our semantic constructions to the set of preferential and rational properties considered. Besides showing that our semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in DLs. Indeed, we also analyse the problem of non-monotonic reasoning in DLs at the level of entailment and present an algorithm for the computation of rational closure of a defeasible ontology. Importantly, our algorithm relies completely on classical entailment and shows that the computational complexity of reasoning over defeasible ontologies is no worse than that of reasoning in the underlying classical DL ALC.
Open AccessTheoretical Foundations of Defeasible Description Logics
We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional case. In particular, we consider a natural and intuitive semantics for defeasible subsumption, and investigate KLM-style syntactic properties for both preferential and rational subsumption. Our contribution includes two representation results linking our semantic constructions to the set of preferential and rational properties considered. Besides showing that our semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in DLs. Indeed, we also analyse the problem of non-monotonic reasoning in DLs at the level of entailment and present an algorithm for the computation of rational closure of a defeasible ontology. Importantly, our algorithm relies completely on classical entailment and shows that the computational complexity of reasoning over defeasible ontologies is no worse than that of reasoning in the underlying classical DL ALC.
- Open Access
- 1 January 2019
- Published by IOS Press
- p. 63-72
Similarity and Relevance of Court Decisions: A Computational Study on CJEU Cases
- 1 January 2019
- Published by IOS Press
- p. 63-72
Open AccessSimilarity and Relevance of Court Decisions: A Computational Study on CJEU Cases
- Open Access
- 16 August 2017
- Published by Center for Open Science in Thesis Commons
Practical Reasoning for Defeasible Description Logics
Description Logics (DLs) are a family of logic-based languages for formalisingontologies. They have useful computational properties allowing the developmentof automated reasoning engines to infer implicit knowledge fromontologies. However, classical DLs do not tolerate exceptions to specifiedknowledge. This led to the prominent research area of nonmonotonic or defeasiblereasoning for DLs, where most techniques were adapted from seminalworks for propositional and first-order logic.Despite the topic's attention in the literature, there remains no consensuson what "sensible" defeasible reasoning means for DLs. Furthermore, thereare solid foundations for several approaches and yet no serious implementationsand practical tools. In this thesis, we address the aforementioned issuesin a broad sense. We identify the preferential approach, by Kraus, Lehmannand Magidor (KLM) in propositional logic, as a suitable abstract frameworkfor defining and studying the precepts of sensible defeasible reasoning.We give a generalisation of KLM's precepts, and their arguments motivatingthem, to the DL case. We also provide several preferential algorithmsfor defeasible entailment in DLs; evaluate these algorithms; and the mainalternatives in the literature, against the agreed upon precepts; extensivelytest the performance of these algorithms, and ultimately consolidate our implementation in a software tool called Defeasible-Inference Platform (DIP).We found some useful entailment regimes within the preferential contextthat satisfy all the KLM properties and some that have scalable performancein real world ontologies even without extensive optimisation.
- 16 August 2017
- Published by Center for Open Science in Thesis Commons
Open AccessPractical Reasoning for Defeasible Description Logics
Description Logics (DLs) are a family of logic-based languages for formalisingontologies. They have useful computational properties allowing the developmentof automated reasoning engines to infer implicit knowledge fromontologies. However, classical DLs do not tolerate exceptions to specifiedknowledge. This led to the prominent research area of nonmonotonic or defeasiblereasoning for DLs, where most techniques were adapted from seminalworks for propositional and first-order logic.Despite the topic's attention in the literature, there remains no consensuson what "sensible" defeasible reasoning means for DLs. Furthermore, thereare solid foundations for several approaches and yet no serious implementationsand practical tools. In this thesis, we address the aforementioned issuesin a broad sense. We identify the preferential approach, by Kraus, Lehmannand Magidor (KLM) in propositional logic, as a suitable abstract frameworkfor defining and studying the precepts of sensible defeasible reasoning.We give a generalisation of KLM's precepts, and their arguments motivatingthem, to the DL case. We also provide several preferential algorithmsfor defeasible entailment in DLs; evaluate these algorithms; and the mainalternatives in the literature, against the agreed upon precepts; extensivelytest the performance of these algorithms, and ultimately consolidate our implementation in a software tool called Defeasible-Inference Platform (DIP).We found some useful entailment regimes within the preferential contextthat satisfy all the KLM properties and some that have scalable performancein real world ontologies even without extensive optimisation.
- Open Access
- 1 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 69-78
A defeasible reasoning approach for description logic ontologies
- 1 October 2012
- Published by Association for Computing Machinery (ACM)
- p. 69-78
Open AccessA defeasible reasoning approach for description logic ontologies