2018
Giesselbach, Sven; Ullrich, Katrin; Kamp, Michael; Paurat, Daniel; GĂ€rtner, Thomas
Corresponding Projections for Orphan Screening Workshop
Proceedings of the ML4H workshop at NeurIPS, 2018.
Links | BibTeX | Tags: corresponding projections, transfer learning, unsupervised
@workshop{giesselbach2018corresponding,
title = {Corresponding Projections for Orphan Screening},
author = {Sven Giesselbach and Katrin Ullrich and Michael Kamp and Daniel Paurat and Thomas GĂ€rtner},
url = {http://michaelkamp.org/wp-content/uploads/2018/12/cpNIPS.pdf},
year = {2018},
date = {2018-12-08},
urldate = {2018-12-08},
booktitle = {Proceedings of the ML4H workshop at NeurIPS},
keywords = {corresponding projections, transfer learning, unsupervised},
pubstate = {published},
tppubtype = {workshop}
}
2016
Ullrich, Katrin; Kamp, Michael; GĂ€rtner, Thomas; Vogt, Martin; Wrobel, Stefan
Ligand-based virtual screening with co-regularised support Vector Regression Proceedings Article
In: 2016 IEEE 16th international conference on data mining workshops (ICDMW), pp. 261â268, IEEE 2016.
Abstract | Links | BibTeX | Tags: biology, chemistry, corresponding projections, semi-supervised
@inproceedings{ullrich2016ligand,
title = {Ligand-based virtual screening with co-regularised support Vector Regression},
author = {Katrin Ullrich and Michael Kamp and Thomas GĂ€rtner and Martin Vogt and Stefan Wrobel},
url = {http://michaelkamp.org/wp-content/uploads/2020/03/LigandBasedCoSVR.pdf},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
booktitle = {2016 IEEE 16th international conference on data mining workshops (ICDMW)},
pages = {261--268},
organization = {IEEE},
abstract = {We consider the problem of ligand affinity prediction as a regression task, typically with few labelled examples, many unlabelled instances, and multiple views on the data. In chemoinformatics, the prediction of binding affinities for protein ligands is an important but also challenging task. As protein-ligand bonds trigger biochemical reactions, their characterisation is a crucial step in the process of drug discovery and design. However, the practical determination of ligand affinities is very expensive, whereas unlabelled compounds are available in abundance. Additionally, many different vectorial representations for compounds (molecular fingerprints) exist that cover different sets of features. To this task we propose to apply a co-regularisation approach, which extracts information from unlabelled examples by ensuring that individual models trained on different fingerprints make similar predictions. We extend support vector regression similarly to the existing co-regularised least squares regression (CoRLSR) and obtain a co-regularised support vector regression (CoSVR). We empirically evaluate the performance of CoSVR on various protein-ligand datasets. We show that CoSVR outperforms CoRLSR as well as existing state-of-the-art approaches that do not take unlabelled molecules into account. Additionally, we provide a theoretical bound on the Rademacher complexity for CoSVR.},
keywords = {biology, chemistry, corresponding projections, semi-supervised},
pubstate = {published},
tppubtype = {inproceedings}
}
We consider the problem of ligand affinity prediction as a regression task, typically with few labelled examples, many unlabelled instances, and multiple views on the data. In chemoinformatics, the prediction of binding affinities for protein ligands is an important but also challenging task. As protein-ligand bonds trigger biochemical reactions, their characterisation is a crucial step in the process of drug discovery and design. However, the practical determination of ligand affinities is very expensive, whereas unlabelled compounds are available in abundance. Additionally, many different vectorial representations for compounds (molecular fingerprints) exist that cover different sets of features. To this task we propose to apply a co-regularisation approach, which extracts information from unlabelled examples by ensuring that individual models trained on different fingerprints make similar predictions. We extend support vector regression similarly to the existing co-regularised least squares regression (CoRLSR) and obtain a co-regularised support vector regression (CoSVR). We empirically evaluate the performance of CoSVR on various protein-ligand datasets. We show that CoSVR outperforms CoRLSR as well as existing state-of-the-art approaches that do not take unlabelled molecules into account. Additionally, we provide a theoretical bound on the Rademacher complexity for CoSVR.
