Eric Gaussier

Prof. Eric Gaussier


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
30 April 2015 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
GTGeorge Tsatsaronis
George Tsatsaronis
GBGeorgios Balikas
Georgios Balikas
PMProdromos Malakasiotis
Prodromos Malakasiotis
IPIoannis Partalas
Ioannis Partalas
MZMatthias Zschunke
Matthias Zschunke
GPGeorgios Paliouras
Georgios Paliouras
This article provides an overview of the first BioASQ challenge, a competition on large-scale biomedical semantic indexing and question answering (QA), which took place between March and September 2013. BioASQ assesses the ability of systems to semantically index very large numbers of biomedical scientific articles, and to return concise and user-understandable answers to given natural language questions by combining information from biomedical articles and ontologies.

6 September 2014 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
AKAris Kosmopoulos
Aris Kosmopoulos
IPIoannis Partalas
Ioannis Partalas
EGEric Gaussier
Eric Gaussier
GPGeorgios Paliouras
Georgios Paliouras
IAIon Androutsopoulos
Ion Androutsopoulos

21 June 2016 in arXiv
Verified
Preprint
Open access
PDF file
TTThéo Trouillon
Théo Trouillon
JWJohannes Welbl
Johannes Welbl
SRSebastian Riedel
Sebastian Riedel
EGEric Gaussier
Eric Gaussier
GBGuillaume Bouchard
Guillaume Bouchard
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermitian dot product, the complex counterpart of the standard dot product between real vectors. Our approach is scalable to large datasets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.

17 September 2010 in Information Retrieval Journal
Verified
Journal Article
Closed access
PDF file
SCStéphane Clinchant
Stéphane Clinchant
EGEric Gaussier
Eric Gaussier

19 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
This study addresses the problem of learning a summary causal graph on time series with potentially different sampling rates. To do so, we first propose a new causal temporal mutual information measure for time series. We then show how this measure relates to an entropy reduction principle that can be seen as a special case of the probability raising principle. We finally combine these two ingredients in PC-like and FCI-like algorithms to construct the summary causal graph. There algorithm are evaluated on several datasets, which shows both their efficacy and efficiency.

2 September 2022 in Entropy
Verified
Journal Article
Open access
PDF file
LZLei ZAN
Lei ZAN
AMAnouar Meynaoui
Anouar Meynaoui
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
In this study, we focus on mixed data which are either observations of univariate random variables which can be quantitative or qualitative, or observations of multivariate random variables such that each variable can include both quantitative and qualitative components. We first propose a novel method, called CMIh, to estimate conditional mutual information taking advantages of the previously proposed approaches for qualitative and quantitative data. We then introduce a new local permutation test, called LocAT for local adaptive test, which is well adapted to mixed data. Our experiments illustrate the good behaviour of CMIh and LocAT, and show their respective abilities to accurately estimate conditional mutual information and to detect conditional (in)dependence for mixed data.