Finding relational associations in HIV resistance mutation data
De Raedt, Luc (Hrsg). Inductive Logic Programming : 19th International Conference, ILP 2009, Leuven, Belgium, July 02-04, 2009. Berlin u.a.: Springer Berlin Heidelberg 2010 S. 202 - 208
Erscheinungsjahr: 2010
ISBN/ISSN: 978-3-642-13839-3 ; 978-3-642-13840-9
Publikationstyp: Buchbeitrag (Konferenzbeitrag)
Sprache: Englisch
Doi/URN: 10.1007/978-3-642-13840-9_19
| Geprüft: | Bibliothek |
Inhaltszusammenfassung
HIV therapy optimization is a hard task due to rapidly evolving mutations leading to drug resistance. Over the past five years, several machine learning approaches have been developed for decision support, mostly to predict therapy failure from the genotypic sequence of viral proteins and additional factors. In this paper, we define a relational representation for an important part of the data, namely the sequences of a viral protein (reverse transcriptase), their mutations, and the drug resi...HIV therapy optimization is a hard task due to rapidly evolving mutations leading to drug resistance. Over the past five years, several machine learning approaches have been developed for decision support, mostly to predict therapy failure from the genotypic sequence of viral proteins and additional factors. In this paper, we define a relational representation for an important part of the data, namely the sequences of a viral protein (reverse transcriptase), their mutations, and the drug resistance(s) associated with those mutations. The data were retrieved from the Los Alamos National Laboratories' (LANL) HIV databases. In contrast to existing work in this area, we do not aim directly for predictive modeling, but take one step back and apply descriptive mining methods to develop a better understanding of the correlations and associations between mutations and resistances. In our particular application, we use the Warmr algorithm to detect non-trivial patterns connecting mutations and resistances. Our findings suggest that well-known facts can be rediscovered, but also hint at the potential of discovering yet unknown associations.» weiterlesen» einklappen
Autoren
Klassifikation
DFG Fachgebiet:
4.43 - Informatik
DDC Sachgruppe:
Informatik