Pierre-Yves Vandenbussche

Pierre-Yves Vandenbussche

Auto-generated profile, based on publicly available information

Pierre-Yves Vandenbussche

Fujitsu Ireland Ltd

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 December 2016 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Open access
PDF file
PVPierre-Yves Vandenbussche
Pierre-Yves Vandenbussche
GAGhislain A. Atemezing
Ghislain A. Atemezing
MPMaría Poveda-Villalón
María Poveda-Villalón
BVBernard Vatant
Bernard Vatant
One of the major barriers to the deployment of Linked Data is the difficulty that data publishers have in determining which vocabularies to use to describe the semantics of data. This systematic report describes Linked Open Vocabularies (LOV), a high

1 January 2013
Verified
Book Chapter
Closed access
PDF file
CBCarlos Buil-Aranda
Carlos Buil-Aranda
AHAidan Hogan
Aidan Hogan
JUJürgen Umbrich
Jürgen Umbrich
PVPierre-Yves Vandenbussche
Pierre-Yves Vandenbussche

18 August 2017 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
EMEmir Munoz
Emir Munoz
VNVít Nováček
Vít Nováček
PVPierre-Yves Vandenbussche
Pierre-Yves Vandenbussche
Timely identification of adverse drug reactions (ADRs) is highly important in the domains of public health and pharmacology. Early discovery of potential ADRs can limit their effect on patient lives and also make drug development pipelines more robust and efficient. Reliable in silico prediction of ADRs can be helpful in this context, and thus, it has been intensely studied. Recent works achieved promising results using machine learning. The presented work focuses on machine learning methods that use drug profiles for making predictions and use features from multiple data sources. We argue that despite promising results, existing works have limitations, especially regarding flexibility in experimenting with different data sets and/or predictive models. We suggest to address these limitations by generalization of the key principles used by the state of the art. Namely, we explore effects of: (1) using knowledge graphs—machine-readable interlinked representations of biomedical knowledge—as a convenient uniform representation of heterogeneous data; and (2) casting ADR prediction as a multi-label ranking problem. We present a specific way of using knowledge graphs to generate different feature sets and demonstrate favourable performance of selected off-the-shelf multi-label learning models in comparison with existing works. Our experiments suggest better suitability of certain multi-label learning methods for applications where ranking is preferred. The presented approach can be easily extended to other feature sources or machine learning methods, making it flexible for experiments tuned toward specific requirements of end users. Our work also provides a clearly defined and reproducible baseline for any future related experiments.

7 August 2017 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Closed access
PDF file
PVPierre-Yves Vandenbussche
Pierre-Yves Vandenbussche
JUJürgen Umbrich
Jürgen Umbrich
LMLuca Matteis
Luca Matteis
AHAidan Hogan
Aidan Hogan
CBCarlos Buil-Aranda
Carlos Buil-Aranda
We describe SPARQLES: an online system that monitors the health of public SPARQL endpoints on the Web by probing them with custom-designed queries at regular intervals. We present the architecture of SPARQLES and the variety of analytics that it runs

30 December 2017
Verified
Book Chapter
Open access
PDF file
PMPasquale Minervini
Pasquale Minervini
LCLuca Costabello
Luca Costabello
EMEmir Munoz
Emir Munoz
VNVít Nováček
Vít Nováček
PVPierre-Yves Vandenbussche
Pierre-Yves Vandenbussche
Learning embeddings of entities and relations using neural architectures is an effective method of performing statistical learning on large-scale relational data, such as knowledge graphs. In this paper, we consider the problem of regularizing the training of neural knowledge graph embeddings by leveraging external background knowledge. We propose a principled and scalable method for leveraging equivalence and inversion axioms during the learning process, by imposing a set of model-dependent soft constraints on the predicate embeddings. The method has several advantages: (i) the number of introduced constraints does not depend on the number of entities in the knowledge base; (ii) regularities in the embedding space effectively reflect available background knowledge; (iii) it yields more accurate results in link prediction tasks over non-regularized methods; and (iv) it can be adapted to a variety of models, without affecting their scalability properties. We demonstrate the effectiveness of the proposed method on several large knowledge graphs. Our evaluation shows that it consistently improves the predictive accuracy of several neural knowledge graph embedding models (for instance, the MRR of TransE on WordNet increases by 11%) without compromising their scalability properties.

3 December 2020 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
VNVít Nováček
Vít Nováček
GMGavin McGauran
Gavin McGauran
David MatallanasDavid Matallanas
David Matallanas
ABAdrián Vallejo Blanco
Adrián Vallejo Blanco
PCPiero Conca
Piero Conca
DFDirk Fey
Dirk Fey
Phosphorylation of specific substrates by protein kinases is a key control mechanism for vital cell-fate decisions and other cellular processes. However, discovering specific kinase-substrate relationships is time-consuming and often rather serendipitous. Computational predictions alleviate these challenges, but the current approaches suffer from limitations like restricted kinome coverage and inaccuracy. They also typically utilise only local features without reflecting broader interaction context. To address these limitations, we have developed an alternative predictive model. It uses statistical relational learning on top of phosphorylation networks interpreted as knowledge graphs, a simple yet robust model for representing networked knowledge. Compared to a representative selection of six existing systems, our model has the highest kinome coverage and produces biologically valid high-confidence predictions not possible with the other tools. Specifically, we have experimentally validated predictions of previously unknown phosphorylations by the LATS1, AKT1, PKA and MST2 kinases in human. Thus, our tool is useful for focusing phosphoproteomic experiments, and facilitates the discovery of new phosphorylation reactions. Our model can be accessed publicly via an easy-to-use web interface (LinkPhinder).